Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Hamkins et al. (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: