Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Theoretical Computer Science - Special issue on real numbers and computers
There's plenty of room at the bottom
Feynman and computation
Simulating physics with computers
Feynman and computation
Alan Turing: The Enigma
Minds and Machines
Minds and Machines
Lorentz lattice gases and many-dimensional Turing machines
Collision-based computing
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Theoretical Computer Science
Computability of analog networks
Theoretical Computer Science
Are There New Models of Computation? Reply to Wegner and Eberbach
The Computer Journal
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
The church-turing thesis: consensus and opposition
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Constraints on hypercomputation
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Non-classical computing: feasible versus infeasible
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
| Hi-index | 5.23 |
Many attempts to transcend the fundamental limitations to computability implied by the Halting Problem for Turing Machines depend on the use of forms of hypercomputation that draw on notions of infinite or continuous, as opposed to bounded or discrete, computation. Thus, such schemes may include the deployment of actualised rather than potential infinities of physical resources, or of physical representations of real numbers to arbitrary precision. Here, we argue that such bases for hypercomputation are not materially realisable and so cannot constitute new forms of effective calculability.