Turing Computations On Ordinals

DOI10.2178/bsl/1122038993zbMath1096.03053arXivmath/0502264OpenAlexW2134322756MaRDI QIDQ3370613

Peter Koepke

Publication date: 8 February 2006

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

Full work available at URL: https://arxiv.org/abs/math/0502264

zbMATH Keywords

Turing machinesgeneralized continuum hypothesisconstructible universeordinal computabilitycomputations on tapes of arbitrary ordinal length

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Continuum hypothesis and Martin's axiom (03E50) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (27)

Effectivity and reducibility with ordinal Turing machines ⋮ Space-bounded OTMs and REG ∞ ⋮ Some Transfinite Generalisations of Gödel’s Incompleteness Theorem ⋮ Generalized Effective Reducibility ⋮ A Candidate for the Generalised Real Line ⋮ The computational power of infinite time Blum-Shub-Smale machines ⋮ On λ-Definable Functions on Ordinals ⋮ Discrete Transfinite Computation ⋮ An Enhanced Theory of Infinite Time Register Machines ⋮ Symmetry for transfinite computability ⋮ Realisability for infinitary intuitionistic set theory ⋮ The computational strengths of \(\alpha\)-tape infinite time Turing machines ⋮ Register computations on ordinals ⋮ Transfinite recursion and computation in the iterative conception of set ⋮ Ordinal Computability ⋮ Minimality considerations for ordinal computers modeling constructibility ⋮ Randomness and degree theory for infinite time register machines1 ⋮ Koepke machines and satisfiability for infinitary propositional languages ⋮ Towards computable analysis on the generalised real line ⋮ The basic theory of infinite time register machines ⋮ Unnamed Item ⋮ Taming Koepke's zoo. II: Register machines ⋮ Post's problem for ordinal register machines: an explicit approach ⋮ Ordinal machines and admissible recursion theory ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines ⋮ Clockability for ordinal Turing machines ⋮ Cofinally invariant sequences and revision

Cites Work

• Unnamed Item
• Unnamed Item
• Weak Second‐Order Arithmetic and Finite Automata
• Infinite time Turing machines
• The fine structure of the constructible hierarchy
• Consistency of the Continuum Hypothesis. (AM-3)

This page was built for publication: Turing Computations On Ordinals