Admissibles in gaps

DOI10.1007/978-3-319-58741-7_18MaRDI QIDQ2011650zbMATH OpenOpenAlexFDO

Authors Merlin Carl, Bruno Durand, Grégory Lafitte, Sabrina Ouazzani

Publication date 4 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-58741-7_18

Mathematics Subject Classification ID

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

Recommendations

• New Computational Paradigms
• Infinite time extensions of Kleene's \({\mathcal O}\)
• The basic theory of infinite time register machines
• The Length of Infinite Time Turing Machine Computations
• Cardinal-recognizing infinite time Turing machines

Cites work

• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• Eventually infinite time Turing machine degrees: infinite time decidable reals
• Infinite time Turing machines
• New Computational Paradigms
• The Length of Infinite Time Turing Machine Computations

Cited in

(1)

• Clockability for ordinal Turing machines

This page was built for publication: Admissibles in gaps

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