Lower bounds on \(\beta (\alpha)\)

DOI10.1007/978-3-031-08740-0_6OpenAlexW4285264913MaRDI QIDQ2104252

Merlin Carl

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08740-0_6

zbMATH Keywords

ordinal computabilityinfinite time register machinesgandy ordinals

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Register computations on ordinals
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Ordinal computability. An introduction to infinitary machines
• Taming Koepke's zoo. II: Register machines
• The basic theory of infinite time register machines
• The computational power of infinite time Blum-Shub-Smale machines
• What is the theory without power set?
• Ordinal Computability
• The next admissible ordinal
• Uncountable Gandy Ordinals

This page was built for publication: Lower bounds on \(\beta (\alpha)\)