A simple solution of the uniform halting problem
Journal of Symbolic Logic 34 (4):639-640 (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,631 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesMichael Strevens (2001). The Bayesian Treatment of Auxiliary Hypotheses. British Journal for the Philosophy of Science 52 (3):515-537.
Paolo Cotogno (2009). A Brief Critique of Pure Hypercomputation. Minds and Machines 19 (3):391-405.
Verónica Becher & Santiago Figueira (2005). Kolmogorov Complexity for Possibly Infinite Computations. Journal of Logic, Language and Information 14 (2).
Xavier Caicedo (1986). A Simple Solution to Friedman's Fourth Problem. Journal of Symbolic Logic 51 (3):778-784.
Laurence Goldstein (2005). Introduction. The Monist 88 (1):3-10.
A. H. Lachlan (1975). Uniform Enumeration Operations. Journal of Symbolic Logic 40 (3):401-409.
Gabor T. Herman (1969). The Unsolvability of the Uniform Halting Problem for Two State Turing Machines. Journal of Symbolic Logic 34 (2):161-165.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads9 ( #113,901 of 548,972 )Recent downloads (6 months)1 ( #63,511 of 548,972 )How can I increase my downloads? |
My notes
Discussion
