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

• J. D. Hamkins and A. Lewis, “Post’s problem for supertasks has both positive and negative solutions,” Arch.~Math.~Logic, vol. 41, iss. 6, pp. 507-523, 2002.
@article{HamkinsLewis2002:PostProblem,
AUTHOR = {Hamkins, Joel David and Lewis, Andrew},
TITLE = {Post's problem for supertasks has both positive and negative solutions},
JOURNAL = {Arch.~Math.~Logic},
FJOURNAL = {Archive for Mathematical Logic},
VOLUME = {41},
YEAR = {2002},
NUMBER = {6},
PAGES = {507--523},
ISSN = {0933-5846},
CODEN = {AMLOEH},
MRCLASS = {03D10 (68Q05)},
MRNUMBER = {1923194 (2003f:03052)},
MRREVIEWER = {Robert M.~Baer},
DOI = {10.1007/s001530100112},
URL = {http://dx.doi.org/10.1007/s001530100112},
eprint = {math/9808128},
archivePrefix = {arXiv},
primaryClass = {math.LO},
}

Recently we have introduced a new model of infinite computation by extending the operation of ordinary Turing machines into transfinite ordinal time. In this paper we will show that the infinite time Turing machine analogue of Post’s problem, the question whether there are supertask degrees between $0$ and the supertask jump $0^\triangledown$, has in a sense both positive and negative solutions. Namely, in the context of the reals there are no degrees between $0$ and $0^\triangledown$, but in the context of sets of reals, there are; indeed, there are incomparable semi-decidable supertask degrees. Both arguments employ a kind of transfinite-injury construction which generalizes canonically to oracles.

# Infinite time Turing machines

• J. D. Hamkins and A. Lewis, “Infinite time Turing machines,” J.~Symbolic Logic, vol. 65, iss. 2, pp. 567-604, 2000.
@article {HamkinsLewis2000:InfiniteTimeTM,
AUTHOR = {Hamkins, Joel David and Lewis, Andy},
TITLE = {Infinite time {T}uring machines},
JOURNAL = {J.~Symbolic Logic},
FJOURNAL = {The Journal of Symbolic Logic},
VOLUME = {65},
YEAR = {2000},
NUMBER = {2},
PAGES = {567--604},
ISSN = {0022-4812},
CODEN = {JSYLA6},
MRCLASS = {03D10 (03D25 68Q05)},
MRNUMBER = {1771072 (2001g:03072)},
MRREVIEWER = {Robert M.~Baer},
DOI = {10.2307/2586556},
URL = {http://dx.doi.org/10.2307/2586556},
eprint = {math/9808093},
archivePrefix = {arXiv},
primaryClass = {math.LO},
}

This is the seminal paper introducing infinite time Turing machines.

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. The resulting computability theory leads to a notion of computation on the reals and concepts of decidability and semi-decidability for sets of reals as well as individual reals. Every $\Pi^1_1$ set, for example, is decidable by such machines, and the semi-decidable sets form a portion of the $\Delta^1_2$ sets. Our oracle concept leads to a notion of relative computability for reals and sets of reals and a rich degree structure, stratified by two natural jump operators.