Do Accelerating Turing Machines Compute the Uncomputable?
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term “accelerating Turing machine” is used to refer to two very different species of accelerating machine, which we call end-stage-in and end-stage-out machines, respectively. We argue that end-stage-in accelerating machines are not Turing machines at all. We then present two differing conceptions of computation, the internal and the external, and introduce the notion of an epistemic embedding of a computation. We argue that no accelerating Turing machine computes the halting function in the internal sense. Finally, we distinguish between two very different conceptions of the Turing machine, the purist conception and the realist conception; and we argue that Turing himself was no subscriber to the purist conception. We conclude that under the realist conception, but not under the purist conception, an accelerating Turing machine is able to compute the halting function in the external sense. We adopt a relatively informal approach throughout, since we take the key issues to be philosophical rather than mathematical.
- Do Accelerating Turing Machines Compute the Uncomputable?
Minds and Machines
Volume 21, Issue 2 , pp 221-239
- Cover Date
- Print ISSN
- Online ISSN
- Springer Netherlands
- Additional Links
- Accelerating Turing machine
- Halting problem
- ATM paradox
- External and internal computation
- Epistemic embedding
- Ontology of computing
- Turing-machine purism
- Turing-machine realism
- Thompson lamp paradox