Taming Koepke's zoo

DOI10.1007/978-3-319-94418-0_13MaRDI QIDQ1670732zbMATH OpenOpenAlexFDO

Authors Merlin Carl, Sabrina Ouazzani, Philip D. Welch

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94418-0_13

Mathematics Subject Classification ID

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

Recommendations

• Taming Koepke's zoo. II: Register machines
• Ordinals, computations, and models of set theory
• Ordinal computability
• The computational strengths of -tape infinite time Turing machines
• Infinite time extensions of Kleene's \({\mathcal O}\)

Cited in

(5)

• Taming Koepke's zoo. II: Register machines
• Clockability for ordinal Turing machines
• Realisability for infinitary intuitionistic set theory
• Reachability for infinite time Turing machines with long tapes
• An exotic menagerie

This page was built for publication: Taming Koepke's zoo

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