Admissibles in gaps

DOI10.1007/978-3-319-58741-7_18zbMATH Open1436.03235OpenAlexW2613561457MaRDI QIDQ2011650FDOQ2011650

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Infinite time Turing machines
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• The Length of Infinite Time Turing Machine Computations
• Eventually infinite time Turing machine degrees: infinite time decidable reals
• New Computational Paradigms

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)