Journal of Symbolic Logic

Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals

P. D. Welch

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

We characterise explicitly the decidable predicates on integers of Infinite Time Turing machines, in terms of admissibility theory and the constructible hierarchy. We do this by pinning down $\zeta$, the least ordinal not the length of any eventual output of an Infinite Time Turing machine (halting or otherwise); using this the Infinite Time Turing Degrees are considered, and it is shown how the jump operator coincides with the production of mastercodes for the constructible hierarchy; further that the natural ordinals associated with the jump operator satisfy a Spector criterion, and correspond to the L$_\zeta$-stables. It also implies that the machines devised are "$\Sigma_2$ Complete" amongst all such other possible machines. It is shown that least upper bounds of an "eventual jump" hierarchy exist on an initial segment.

Article information

Source
J. Symbolic Logic, Volume 65, Issue 3 (2000), 1193-1203.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183746176

Mathematical Reviews number (MathSciNet)
MR1791371

Zentralblatt MATH identifier
0959.03025

JSTOR
links.jstor.org

Citation

Welch, P. D. Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. J. Symbolic Logic 65 (2000), no. 3, 1193--1203. https://projecteuclid.org/euclid.jsl/1183746176


Export citation