Eventually infinite time Turing machine degrees: infinite time decidable reals

DOI10.2307/2586695zbMath0959.03025OpenAlexW2060434897MaRDI QIDQ4527919

No author found.

Publication date: 2 May 2001

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586695

zbMATH Keywords

infinite time Turing machinesadmissibility theoryjump operatorconstructible hierarchydecidable predicates on integerseventual jump hierarchyinfinite time Turing degrees

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Inner models, including constructibility, ordinal definability, and core models (03E45) Turing machines and related notions (03D10) Other Turing degree structures (03D28) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (13)

Decision times of infinite computations ⋮ Rethinking revision ⋮ Discrete Transfinite Computation ⋮ Parameter-free uniformisation ⋮ Weak systems of determinacy and arithmetical quasi-inductive definitions ⋮ Hypermachines ⋮ Guest editors' introduction ⋮ ULTIMATE TRUTHVIS-À-VISSTABLE TRUTH ⋮ Admissibles in gaps ⋮ On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems ⋮ Infinite time extensions of Kleene's \({\mathcal O}\) ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines

Cites Work

• Infinite time Turing machines
• Unnamed Item

This page was built for publication: Eventually infinite time Turing machine degrees: infinite time decidable reals