Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 51
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Carl, Merlin 2016. Infinite time recognizability from generic oracles and the recognizable jump operator1. Computability, p. 1.

    Carl, Merlin 2016. Randomness and degree theory for infinite time register machines1. Computability, Vol. 5, Issue. 2, p. 181.

    Carl, Merlin 2016. Pursuit of the Universal.

    Haeusler, Edward Hermann 2016. Finiteness and Computation in Toposes. Electronic Proceedings in Theoretical Computer Science, Vol. 204, p. 61.

    Monin, Benoit 2016. Higher Randomness and Forcing with Closed Sets. Theory of Computing Systems,

    Nido Valencia, Juan A. Solís Daun, Julio E. and Villegas Silva, Luis M. 2016. A representation of recursively enumerable sets through Horn formulas in higher recursion theory. Periodica Mathematica Hungarica, Vol. 73, Issue. 1, p. 1.

    Ackerman, Nathanael L. Freer, Cameron E. and Lubarsky, Robert S. 2015. 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science. p. 523.

    BAUER, ANDREJ 2015. An injection from the Baire space to natural numbers. Mathematical Structures in Computer Science, Vol. 25, Issue. 07, p. 1484.

    Rivello, Edoardo 2015. Cofinally Invariant Sequences and Revision. Studia Logica, Vol. 103, Issue. 3, p. 599.

    Carl, Merlin 2014. The distribution of ITRM-recognizable reals. Annals of Pure and Applied Logic, Vol. 165, Issue. 9, p. 1403.

    Edis, Taner and Boudry, Maarten 2014. Beyond Physics? On the Prospects of Finding a Meaningful Oracle. Foundations of Science, Vol. 19, Issue. 4, p. 403.

    Jacquette, Dale 2014. Computable Diagonalizations and Turing’s Cardinality Paradox. Journal for General Philosophy of Science, Vol. 45, Issue. 2, p. 239.

    Pauly, Arno and de Brecht, Matthew 2014. Non-deterministic computation and the Jayne-Rogers Theorem. Electronic Proceedings in Theoretical Computer Science, Vol. 143, p. 87.

    Rin, Benjamin 2014. The computational strengths of α-tape infinite time Turing machines. Annals of Pure and Applied Logic, Vol. 165, Issue. 9, p. 1501.

    WELCH, P. D. 2014. SOME OBSERVATIONS ON TRUTH HIERARCHIES. The Review of Symbolic Logic, Vol. 7, Issue. 01, p. 1.

    Cooper, S. Barry and Leeuwen, Jan Van 2013. Alan Turing: His Work and Impact.

    Martínez, Manolo 2013. Ideal Negative Conceivability and the Halting Problem. Erkenntnis, Vol. 78, Issue. 5, p. 979.

    GOVINDARAJULU, NAVEEN SUNDAR and BRINGSJORD, SELMER 2012. THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION'. Parallel Processing Letters, Vol. 22, Issue. 03, p. 1240012.

    Shagrir, Oron 2012. Supertasks do not increase computational power. Natural Computing, Vol. 11, Issue. 1, p. 51.

    Steinhart, Eric 2012. Royce's Model of the Absolute. Transactions of the Charles S. Peirce Society, Vol. 48, Issue. 3, p. 356.


Infinite time Turing machines

  • Joel David Hamkins (a1) and Andy Lewis (a2)
  • DOI:
  • Published online: 01 March 2014

We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. Every set. for example, is decidable by such machines, and the semi-decidable sets form a portion of the sets. Our oracle concept leads to a notion of relative computability for sets of reals and a rich degree structure, stratified by two natural jump operators.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[Ear & Nor]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. 2242.

[Hog92]Hogarth, Does general relativity allow an observer to view an eternity in a finite time?, Foundations of Physics Letters, vol. 5 (1992), pp. 173181.

[Sacks]Gerald E. Sacks , Higher Recursion Theory, Springer Verlag Publishing Company, New York, 1990.

[Soare]Robert I. Soare , Recursively Enumerable Sets and Degrees, Springer Verlag Publishing Company, New York, 1987.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *