Infinite time extensions of Kleene's \({\mathcal O}\)

DOI10.1007/S00153-009-0146-2zbMath1178.03048OpenAlexW2155844974MaRDI QIDQ1031833

Ansten Mørch Klev

Publication date: 23 October 2009

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-009-0146-2

zbMATH Keywords

halting problemordinal notation systemsinfinite-time Turing computabilityinfinite-time Turing machines

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) Turing machines and related notions (03D10) Inductive definability (03D70)

Related Items (1)

The computational strengths of \(\alpha\)-tape infinite time Turing machines

Cites Work

• Unnamed Item
• Unnamed Item
• Post's problem for supertasks has both positive and negative solutions
• Zur Theorie der konstruktiven Wohlordnungen
• Recursive well-orderings
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• The truth is never simple
• The Length of Infinite Time Turing Machine Computations
• Infinite time Turing machines
• Eventually infinite time Turing machine degrees: infinite time decidable reals
• On notation for ordinal numbers

This page was built for publication: Infinite time extensions of Kleene's \({\mathcal O}\)