Admissibles in gaps

DOI10.1007/978-3-319-58741-7_18zbMath1436.03235OpenAlexW2613561457MaRDI QIDQ2011650

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

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

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

Related Items

Clockability for ordinal Turing machines

Cites Work

• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• The Length of Infinite Time Turing Machine Computations
• Infinite time Turing machines
• Eventually infinite time Turing machine degrees: infinite time decidable reals
• New Computational Paradigms
• Unnamed Item