English
Related papers

Related papers: Practical intractability: a critique of the hyperc…

200 papers

The acceleration race of digital computing technologies seems to be steering toward impasses -- technological, economical and environmental -- a condition that has spurred research efforts in alternative, "neuromorphic" (brain-like)…

Emerging Technologies · Computer Science 2021-04-06 Herbert Jaeger

High Performance Computing (HPC) aims at providing reasonably fast computing solutions to scientific and real life problems. The advent of multicore architectures is noticeable in the HPC history, because it has brought the underlying…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-10-07 Claude Tadonki

The model of interactive Turing machines (ITMs) has been proposed to characterise which stream translations are interactively computable; the model of reactive Turing machines (RTMs) has been proposed to characterise which behaviours are…

Logic in Computer Science · Computer Science 2016-01-12 Bas Luttik , Fei Yang

Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers…

Quantum Physics · Physics 2026-02-05 Laurin E. Fischer

The success of the abstract model of computation, in terms of bits, logical operations, programming language constructs, and the like, makes it easy to forget that computation is a physical process. Our cherished notions of computation and…

Quantum Physics · Physics 2013-06-18 Joseph F. Fitzsimons , Eleanor G. Rieffel , Valerio Scarani

Can a problem undecidable with classical resources be decidable with quantum ones? The answer expected is no; as both being Turing theories, they should not solve the Halting problem - a problem unsolvable by any Turing machine. Yet, we…

Quantum Physics · Physics 2021-12-28 Airin Antony

At the intersection of what I call uncomputable art and computational epistemology, a form of experimental philosophy, we find an exciting and promising area of science related to causation with an alternative, possibly best possible,…

Other Computer Science · Computer Science 2021-09-20 Hector Zenil

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

Logic in Computer Science · Computer Science 2022-09-07 Pedro Hack , Daniel A. Braun , Sebastian Gottwald

Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…

Computational Complexity · Computer Science 2012-03-20 Arto Annila

Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning techniques to impressive results in regression, classification, data-generation and reinforcement learning tasks.…

The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have…

Quantum Physics · Physics 2020-04-21 Francesco Tacchino , Alessandro Chiesa , Stefano Carretta , Dario Gerace

Today, people are looking forward to get an awesome computational power. This kind of desire can be answered by quantum computing. By adopting quantum mechanics theory, it can generate a very fast computation result. As known, quantum…

Other Computer Science · Computer Science 2015-12-18 A. B. Mutiara , R. Refianti , J. S. K. Karamoy

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

Formal Languages and Automata Theory · Computer Science 2025-10-22 Daniel G. Schwartz

Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…

Quantum Physics · Physics 2023-07-21 Dominik Hangleiter , Jens Eisert

I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones.…

Quantum Physics · Physics 2009-10-30 John Preskill

We need much better understanding of information processing and computation as its primary form. Future progress of new computational devices capable of dealing with problems of big data, internet of things, semantic web, cognitive robotics…

General Literature · Computer Science 2013-12-10 Mark Burgin , Gordana Dodig-Crnkovic

Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum…

Quantum Physics · Physics 2009-12-29 Eleanor G. Rieffel

Using an extremely large number of processing elements in computing systems leads to unexpected phenomena, such as different efficiencies of the same system for different tasks, that cannot be explained in the frame of classical computing…

Performance · Computer Science 2022-07-12 János Végh

In recent publications in physics and mathematics, concerns have been raised about the use of real numbers to describe quantities in physics, and in particular about the usual assumption that physical quantities are infinitely precise. In…

History and Philosophy of Physics · Physics 2021-08-13 Tein van der Lugt

This article addresses the question of when physical laws and their consequences can be computed. If a physical system is capable of universal computation, then its energy gap can't be computed. At an even more fundamental level, the most…

Quantum Physics · Physics 2013-12-17 Seth Lloyd