Ordinal Computability

DOI10.1007/978-3-642-03073-4_29zbMath1268.03060OpenAlexW2912644765MaRDI QIDQ3576060

Peter Koepke

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_29

zbMATH Keywords

constructible setsordinal machinesinfinite- time register machines

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ $$ITRM$$-Recognizability from Random Oracles ⋮ Symmetry for transfinite computability ⋮ All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ The distribution of ITRM-recognizable reals ⋮ The computational strengths of \(\alpha\)-tape infinite time Turing machines ⋮ Koepke machines and satisfiability for infinitary propositional languages ⋮ Characterizations of ITBM-computability. I ⋮ OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES ⋮ Unnamed Item ⋮ A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0 ⋮ Taming Koepke's zoo. II: Register machines ⋮ Lower bounds on \(\beta (\alpha)\) ⋮ Clockability for ordinal Turing machines

Cites Work

• Unnamed Item
• Register computations on ordinals
• Ordinal machines and admissible recursion theory
• Turing Computations On Ordinals
• An Enhanced Theory of Infinite Time Register Machines
• Infinite time Turing machines

This page was built for publication: Ordinal Computability