Computability and logic: 3rd ed.
Computability and logic: 3rd ed.
Complexity - Special issue on uncoventional models of computation
How we know what technology can do
Communications of the ACM
Minds and Machines
Minds and Machines
Physical Hypercomputation and the Church–Turing Thesis
Minds and Machines
Accelerating machines: a review
International Journal of Parallel, Emergent and Distributed Systems
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
A Brief Critique of Pure Hypercomputation
Minds and Machines
A note on accelerated turing machines
Mathematical Structures in Computer Science
On the Possibilities of Hypercomputing Supertasks
Minds and Machines
Philosophy of Mind Is (in Part) Philosophy of Computer Science
Minds and Machines
Do Accelerating Turing Machines Compute the Uncomputable?
Minds and Machines
Supertasks do not increase computational power
Natural Computing: an international journal
| Hi-index | 0.00 |
Accelerating Turing machines are devices with the same computational structure as Turing machines (TM), but able to perform super-tasks. We ask whether performing super-tasks alone produces more computational power; for example, whether accelerating TM can solve the halting problem. We conclude that this is not the case. No accelerating TM solves the halting problem. The argument rests on an analysis of the reasoning that leads to Thomson's paradox. The key point is that the paradox rests on a conflation of different perspectives of accelerating processes. This leads to concluding that the same conflation underlies the claim that accelerating TM can solve the halting problem.