Infinite time Turing machines
Journal of Symbolic Logic 65 (2):567-604 (2000)
| Abstract | Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and limitations of supertask algorithms. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesPaolo Cotogno (2009). A Brief Critique of Pure Hypercomputation. Minds and Machines 19 (3):391-405.
Yaroslav Sergeyev & Alfredo Garro (2010). Observability of Turing Machines: A Refinement of the Theory of Computation. Informatica 21 (3):425–454.
Eric Steinhart (2007). Infinitely Complex Machines. In Intelligent Computing Everywhere. Springer.
Philip D. Welch (2004). On the Possibility, or Otherwise, of Hypercomputation. British Journal for the Philosophy of Science 55 (4):739-746.
Eric Steinhart (2003). Supermachines and Superminds. Minds and Machines 13 (1):155-186.
D. King (1996). Is the Human Mind a Turing Machine? Synthese 108 (3):379-89.
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
Joel David Hamkins (2002). Infinite Time Turing Machines. Minds and Machines 12 (4):567-604.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads16 ( #74,758 of 549,196 )Recent downloads (6 months)1 ( #63,397 of 549,196 )How can I increase my downloads? |
My notes
Discussion
