Minds and Machines 26 (3):253-257 (2016)

Ofra Rechter
Tel Aviv University
Eli Dresner
Tel Aviv University
In their recent paper “Do Accelerating Turing Machines Compute the Uncomputable?” Copeland and Shagrir draw a distinction between a purist conception of Turing machines, according to which these machines are purely abstract, and Turing machine realism according to which Turing machines are spatio-temporal and causal “notional" machines. In the present response to that paper we concede the realistic aspects of Turing’s own presentation of his machines, pointed out by Copeland and Shagrir, but argue that Turing's treatment of symbols in the course of that presentation opens the door for later purist conceptions. Also, we argue that a purist conception of Turing machines plays an important role not only in the analysis of the computational properties of Turing machines, but also in the philosophical debates over the nature of their realization.
Keywords Accelerating Turing machine  Turing machine purism  Turing machine realism
Categories (categorize this paper)
DOI 10.1007/s11023-016-9394-1
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,039
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
What is Computation?B. Jack Copeland - 1996 - Synthese 108 (3):335-59.
Mathematics in Philosophy.Charles Parsons - 1986 - Philosophy of Science 53 (4):588-606.

View all 6 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Turing's Golden: How Well Turing's Work Stands Today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Is the Human Mind a Turing Machine?D. King - 1996 - Synthese 108 (3):379-89.
Undecidability in the Imitation Game.Y. Sato & T. Ikegami - 2004 - Minds and Machines 14 (2):133-43.
Olympia and Other O-Machines.Colin Klein - 2015 - Philosophia 43 (4):925-931.
The Broad Conception of Computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Infinite Time Turing Machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Turing Interrogative Games.Paweł Łupkowski & Andrzej Wiśniewski - 2011 - Minds and Machines 21 (3):435-448.


Added to PP index

Total views
16 ( #665,402 of 2,506,002 )

Recent downloads (6 months)
1 ( #416,828 of 2,506,002 )

How can I increase my downloads?


My notes