Computability and logic: 3rd ed.
Computability and logic: 3rd ed.
The rediscovery of the mind
Complexity - Special issue on uncoventional models of computation
Godel Escher Bach: An Eternal Golden Braid
Godel Escher Bach: An Eternal Golden Braid
Minds and Machines
Creativity, the Turing Test, and the (Better) Lovelace Test
Minds and Machines
Computation: finite and infinite machines
Computation: finite and infinite machines
Minds and Machines
Minds and Machines
Physical Hypercomputation and the Church–Turing Thesis
Minds and Machines
Hypercomputation in the Chinese Room
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Super-tasks, accelerating Turing machines and uncomputability
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Hypercomputation: philosophical issues
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Zeno machines and hypercomputation
Theoretical Computer Science
Physical Computation: How General are Gandy's Principles for Mechanisms?
Minds and Machines
Physical constraints on hypercomputation
Theoretical Computer Science
Accelerating machines: a review
International Journal of Parallel, Emergent and Distributed Systems
Non-classical computing: feasible versus infeasible
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
A note on accelerated turing machines
Mathematical Structures in Computer Science
On the Possibilities of Hypercomputing Supertasks
Minds and Machines
Do Accelerating Turing Machines Compute the Uncomputable?
Minds and Machines
Multi-resolution cellular automata for real computation
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Supertasks do not increase computational power
Natural Computing: an international journal
Computation as an unbounded process
Theoretical Computer Science
Grand challenge 7: journeys in non-classical computation
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A Revised Attack on Computational Ontology
Minds and Machines
| Hi-index | 0.00 |
Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of π contains n consecutive 7s, for any n; solve the Turing-machine halting problem; and decide the predicate calculus. Are accelerating Turing machines, then, logically impossible devices? I argue that they are not. There are implications concerning the nature of effective procedures and the theoretical limits of computability. Contrary to a recent paper by Bringsjord, Bello and Ferrucci, however, the concept of an accelerating Turing machine cannot be used to shove up Searle's Chinese room argument.