Cargando…

Clockability for Ordinal Turing Machines

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 [Formula: see text]-admissible ordinals are never OTM-clockable and that gaps in the OTM-clockable ordinals are always started...

Descripción completa

Detalles Bibliográficos
Autor principal: Carl, Merlin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7309483/
http://dx.doi.org/10.1007/978-3-030-51466-2_2