Infinite time turing machines with only one tape

Mathematical Logic Quarterly

Volumn 47, Issue 2, 2001, Pages 271-287

  Hamkins, Joel David ^a   Seabold, Daniel Evan ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b HOFSTRA UNIVERSITY   (United States)

Author keywords

One tape infinite turing machine; Supertask computation

Indexed keywords

EID: 0035531237     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/1521-3870(200105)47:2<271::AID-MALQ271>3.0.CO;2-6     Document Type: Article

References (6)

1. HAMKINS, J. D., and A. LEWIS, Infinite time turing machines. J. Symbolic Logic (to appear)
2. HAMKINS, J. D., and A. LEWIS, Post's problem and infinite time Turing machines. Archive Math. Logic (to appear).
3. SOARE, R., Recursively Enumerable Sets and Degrees. Springer-Verlag, Berlin-Heidelberg-New York 1987.
4. WELCH, PH., The length of infinite time Turing machine computations. Bulletin London Math. Soc. 32 (2000), 129-136.
5. WELCH, PH., Eventually infinite time Turing machine degrees: Infinite time decidable reals. J. Symbolic Logic (to appear).
6. WELCH, PH., Friedman's trick: Minimality arguments in the infinite time Turing degrees. In: Sets and Proofs, Proc. ASL Logic Colloquium 1997, Leeds (S. B. COOPER and J. K. TRUSS, eds.). London Mathematical Society Lecture Notes in Mathematics Series 258, Cambridge University Press, Cambridge 1999, pp. 425-436.