A Note on Clockability for Ordinal Turing Machines
Year: 2019
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Carl, Merlin
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2952673149