Do Accelerating Turing Machines Compute the Uncomputable?

Minds and Machines 21 (2):221-239 (2011)
  Copy   BIBTEX


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.



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
The broad conception of computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Supermachines and superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.
What Turing did after he invented the universal Turing machine.Diane Proudfoot & Jack Copeland - 2000 - Journal of Logic, Language and Information 9:491-509.
Hypercomputation: Computing more than the Turing machine.Toby Ord - 2002 - Dissertation, University of Melbourne
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
WHAT IS. . . a Halting Probability?Cristian S. Calude - 2010 - Notices of the AMS 57:236-237.


Added to PP

179 (#112,506)

6 months
26 (#116,161)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Oron Shagrir
Hebrew University of Jerusalem

Citations of this work

Implementation as Resemblance.André Curtis-Trudel - 2021 - Philosophy of Science 88 (5):1021-1032.
The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.
Quantum computing.Amit Hagar & Michael Cuffaro - 2019 - Stanford Encyclopedia of Philosophy.
Why Do We Need a Theory of Implementation?André Curtis-Trudel - 2022 - British Journal for the Philosophy of Science 73 (4):1067-1091.

View all 11 citations / Add more citations

References found in this work

Word and Object.Willard Van Orman Quine - 1960 - Cambridge, MA, USA: MIT Press.
Computing machinery and intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.
Word and Object.Willard Van Orman Quine - 1960 - Les Etudes Philosophiques 17 (2):278-279.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Philosophy of Mathematics and Natural Science.Hermann Weyl - 1949 - Princeton, N.J.: Princeton University Press. Edited by Olaf Helmer-Hirschberg & Frank Wilczek.

View all 54 references / Add more references