Clockability for Ordinal Turing Machines

被引：0
|
作者：
Carl, Merlin [1 ]
机构：
[1] Europa Univ Flensburg, Inst Math Naturwissenschaftliche & Tech Bldg, Abt Math & Ihre Didakt, Flensburg, Germany
来源：
BEYOND THE HORIZON OF COMPUTABILITY, CIE 2020 | 2020年 / 12098卷
关键词：
D O I：
10.1007/978-3-030-51466-2_2
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 Sigma(2)-admissible ordinals are never OTM-clockable and that gaps in the OTM-clockable ordinals are always started by admissible limits of admissible ordinals. This partially answers two questions in [3].
引用
收藏
页码：14 / 25
页数：12
相关论文
共 50 条
12345