The unsolvability of the uniform halting problem for two state Turing machines
Journal of Symbolic Logic 34 (2):161-165 (1969)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| 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,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesPaolo Cotogno (2003). Hypercomputation and the Physical Church-Turing Thesis. British Journal for the Philosophy of Science 54 (2):181-223.
P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
Gabor T. Herman (1969). A Simple Solution of the Uniform Halting Problem. Journal of Symbolic Logic 34 (4):639-640.
Verónica Becher & Santiago Figueira (2005). Kolmogorov Complexity for Possibly Infinite Computations. Journal of Logic, Language and Information 14 (2).
Toby Ord & Tien D. Kieu (2005). The Diagonal Method and Hypercomputation. British Journal for the Philosophy of Science 56 (1):147-156.
B. Jack Copeland & Oron Shagrir (2011). Do Accelerating Turing Machines Compute the Uncomputable? Minds and Machines 21 (2):221-239.
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
Paolo Cotogno (2009). A Brief Critique of Pure Hypercomputation. Minds and Machines 19 (3):391-405.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #277,406 of 556,896 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
