Infinite time Turing machines

Journal of Symbolic Logic

Volumn 65, Issue 2, 2000, Pages 567-604

  Hamkins, Joel David ^a   Lewis, Andy ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b VIRGINIA COMMONWEALTH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034401276     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586556     Document Type: Article

References (12)

1. JOHN BARWISE, Admissible Set Theory, Springer Verlag Publishing Company, New York, 1990.
2. DERRICK ALBERT DUBOSE, The Equivalency of Determinacy and Iterated Sharps, this JOURNAL, vol. 55 (1980), no. 2, pp. 502-510.
3. JOHN EARMAN, Bangs, crunches, whimpers and shrieks: singularities and acausalities in relativistic spacetimes, The Clarendon Press, Oxford University Press, New York, 1995.
4. JOHN EARMAN and JOHN D. NORTON, Forever is a day: supertasks in Pitowski and Malament-Hogarth spacetimes, Philosophy of Science, vol. 60 (1993), no. 1, pp. 22-42.
5. SOLOMON FEFERMAN and C. SPECTOR, Incompleteness along paths in progressions of theories, this JOURNAL, vol. 27 (1962), pp. 383-390.
6. HOGARTH, Non-Turing computers and non-Turing computability, PSA 1994, Vol 1 East Lansing: Philosohpy of Science Association (D. Hull, M. Forbes, and R.B Burian, editors), pp. 126-138.
7. _, Does general relativity allow an observer to view an eternity in a finite time?, Foundations of Physics Letters, vol. 5 (1992), pp. 173-181.
8. YIANNIS NICHOLAS MOSCHOVAKIS, Descriptive Set Theory, North-Holland Publishing Company, New York, 1980.
9. PITOWSKY, The physical Church Thesis and Physical computational complexity, Iyyun, vol. 39 (1990), pp. 81-99.
10. GERALD E. SACKS, Higher Recursion Theory, Springer Verlag Publishing Company, New York, 1990.
11. ROBERT I. SOARE, Recursively Enumerable Sets and Degrees, Springer Verlag Publishing Company, New York, 1987.
12. THOMSON, Tasks and Super-tasks, Analysis, vol. XV (1954-55), pp. 1-13.