Ordinal computability

DOI10.1007/978-3-642-03073-4_29MaRDI QIDQ3576060zbMATH OpenOpenAlexFDO

Authors 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 setsinfinite- time register machinesordinal machines

Mathematics Subject Classification ID

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

Recommendations

• Ordinals, computations, and models of set theory
• Register computations on ordinals
• Turing Computations On Ordinals
• Ordinal computations
• Ordinal machines and admissible recursion theory

Cites work

• An Enhanced Theory of Infinite Time Register Machines
• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• Infinite time Turing machines
• Ordinal machines and admissible recursion theory
• Register computations on ordinals
• Turing Computations On Ordinals

Cited in

(30)

• Taming Koepke's zoo
• Ordinal computability. An introduction to infinitary machines
• Koepke machines and satisfiability for infinitary propositional languages
• Characterizations of ITBM-computability. I
• Taming Koepke's zoo. II: Register machines
• Lower bounds on \(\beta (\alpha)\)
• Clockability for ordinal Turing machines
• Infinite computations with random oracles
• The distribution of ITRM-recognizable reals
• The computational strengths of -tape infinite time Turing machines
• Minimality considerations for ordinal computers modeling constructibility
• Optimal results on recognizability for infinite time register machines
• A generalised dynamical system, infinite time register machines, and \(\Pi^1_1\)-\(\mathrm{CA}_{0}\)
• ITRM-recognizability from random oracles
• The computability path ordering
• Turing Computations On Ordinals
• Ordinal computations
• Ordinals, computations, and models of set theory
• Ordinal definability in Jensen's model
• scientific article; zbMATH DE number 3991491 (Why is no real title available?)
• Finding bases of uncountable free abelian groups is usually difficult
• Tree representations via ordinal machines
• Reachability for infinite time Turing machines with long tapes
• 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
• The Complexity of Quickly ORM-Decidable Sets
• Turing complexity of the ordinals
• Symmetry for transfinite computability
• All melodies are lost -- recognizability for weak and strong -register machines
• Ordinal arithmetic based on Skolem hulling
• Register computations on ordinals

This page was built for publication: Ordinal computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576060)