Even Turing machines can compute uncomputable functions
| Abstract |
Accelerated Turing machines are Turing machines that perform tasks commonly regarded as impossible, such as computing the halting function. The existence of these notional machines has obvious implications concerning the theoretical limits of computability.
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| Options |
Save to my reading list
Follow the author(s)
My bibliography
Export citation
Edit this record
Mark as duplicate
Request removal from index
|
Download options
References found in this work BETA
No references found.
Citations of this work BETA
Beyond the Universal Turing Machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.
Mirror Notation: Symbol Manipulation Without Inscription Manipulation. [REVIEW]Roy A. Sorensen - 1999 - Journal of Philosophical Logic 28 (2):141-164.
Similar books and articlesThe Broad Conception of Computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Computing Machines Can't Be Intelligent (...And Turing Said So).Peter Kugel - 2002 - Minds and Machines 12 (4):563-579.
Physical Computation: How General Are Gandy's Principles for Mechanisms?B. Jack Copeland & Oron Shagrir - 2007 - Minds and Machines 17 (2):217-231.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
On the Possibilities of Hypercomputing Supertasks.Vincent C. Müller - 2011 - Minds and Machines 21 (1):83-96.
Monthly downloads
Added to index
2009-01-28Total downloads
2 ( #773,629 of 2,172,870 )Recent downloads (6 months)
0How can I increase my downloads?
My notes
Discussion
Nothing in this forum yet.
