Clockability for ordinal Turing machines

DOI10.1007/978-3-030-51466-2_2OpenAlexW3037673859MaRDI QIDQ2106588

Merlin Carl

Publication date: 16 December 2022

Full work available at URL: https://arxiv.org/abs/1906.10087

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines

Cites Work

• Unnamed Item
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• Taming Koepke's zoo
• Admissibles in gaps
• The basic theory of infinite time register machines
• Infinite Time Turing Machines With Only One Tape
• Hypermachines
• Turing Computations On Ordinals
• Ordinal Computability
• Infinite time Turing machines
• Tree Representations via Ordinal Machines
• Degrees of unsolvability of constructible sets of integers

This page was built for publication: Clockability for ordinal Turing machines