A Note on Clockability for Ordinal Turing Machines

Merlin Carl

doi:10.1007/978-3-030-51466-2_2

paper

A Note on Clockability for Ordinal Turing Machines

arXiv:1906.10087 · doi:10.1007/978-3-030-51466-2_2

Abstract

We study clockability for Ordinal Turing Machines (OTMs). In particular, we show that, in contrast to the situation for ITTMs, admissible ordinals can be OTM-clockable, that $Σ_{2}$ -admissible ordinals are never OTM-clockable and that gaps in the OTM-clockable ordinals are always started by admissible limits of admissible ordinals.

Cited by in corpus (1)

Characterisations of Variant Transfinite Computational Models: Infinite Time Turing, Ordinal Time Turing, and Blum-Shub-Smale machines