Do Accelerating Turing Machines Compute the Uncomputable?

Minds and Machines 21 (2):221-239 (2011)
Abstract This article has no associated abstract. (fix it)
Keywords ATM paradox   Accelerating Turing machine   Epistemic embedding   External and internal computation   Halting problem   Hypercomputation   Ontology of computing   Supertask   Thompson lamp paradox   Turing-machine purism   Turing-machine realism
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 14,816
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
David Barker-Plummer, Turing Machines. Stanford Encyclopedia of Philosophy.
R. M. Blake (1926). The Paradox of Temporal Process. Journal of Philosophy 23 (24):645-654.
B. Jack Copeland (2002). Hypercomputation. Minds and Machines 12 (4):461-502.

View all 29 references

Citations of this work BETA

No citations found.

Similar books and articles
Jack Copeland (1997). The Broad Conception of Computation. American Behavioral Scientist 40 (6):690-716.
Toby Ord & Tien D. Kieu (2005). The Diagonal Method and Hypercomputation. British Journal for the Philosophy of Science 56 (1):147-156.
Carol E. Cleland (2002). On Effective Procedures. Minds and Machines 12 (2):159-179.

Monthly downloads

Added to index


Total downloads

51 ( #59,420 of 1,707,725 )

Recent downloads (6 months)

2 ( #266,161 of 1,707,725 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.