Post's problem for supertasks has both positive and negative solutions

Archive for Mathematical Logic

Volumn 41, Issue 6, 2002, Pages 507-523

  Hamkins, Joel David ^a   Lewis, Andrew ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b VIRGINIA COMMONWEALTH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035982243     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530100112     Document Type: Article

References (6)

1. [HamLew] Hamkins, J.D., Lewis, A.: Infinite Time Turing Machines, Journal of Symbolic Logic 65(2), 567-604 (2000)
2. [Sac] Sacks, G.E.: Higher Recursion Theory, Springer-Verlag, 1990
3. [Soa] Soare, R.: Recursively Enumerable Sets and Degrees, Springer-Verlag, 1980
4. [Wel2000a] Welch, P.: The lengths of infinite time Turing machine computations, Bulletin of the London Math. Soc. 32(2), 129-136 (2000)
5. [Wel2000b] Welch, P.: Eventually infinite time Turing degrees, Journal of Symbolic Logic 65(3), 11 (2000)
6. [Wel1999] Welch, P.: Friedman's trick: minimality in the infinite time Turing degrees, in "Sets and Proofs', Proc. European Meeting of the ASL, Leeds, (CVP LMS Lecture Notes in Maths Series 1998) 258, 425-436 (1999)