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 ξ, 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_ξ-stables. It also implies that the machines devised are "Σ_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.
展开▼
