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 条
  • [11] Accelerating Turing Machines
    B. Jack Copeland
    Minds and Machines, 2002, 12 : 281 - 300
  • [12] Turing machines and bimachines
    Rhodes, John
    Silva, Pedro V.
    THEORETICAL COMPUTER SCIENCE, 2008, 400 (1-3) : 182 - 224
  • [13] Accelerating Turing machines
    Copeland, BJ
    MINDS AND MACHINES, 2002, 12 (02) : 281 - 301
  • [14] Ecological turing machines
    Durand, B
    Muchnik, A
    Ushakov, M
    Vereshchagin, N
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 457 - 468
  • [15] Minds, Machines and Turing
    S. Harnad
    Journal of Logic, Language and Information, 2000, 9 (4) : 425 - 445
  • [16] RECURSIVE TURING MACHINES
    SAVITCH, WJ
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1977, 6 (01) : 3 - 31
  • [17] Concurrent turing machines
    Farwer, Berndt
    Kudlek, Manfred
    Roelke, Heiko
    FUNDAMENTA INFORMATICAE, 2007, 79 (3-4) : 303 - 317
  • [18] Turing Machines with Atoms
    Bojanczyk, Mikolaj
    Klin, Bartek
    Lasota, Slawomir
    Torunczyk, Szymon
    2013 28TH ANNUAL IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2013, : 183 - 192
  • [19] Zigzags in Turing Machines
    Gajardo, Anahi
    Guillon, Pierre
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2010, 6072 : 109 - +
  • [20] Structured Turing Machines
    L. P. Lisovik
    Cybernetics and Systems Analysis, 2004, 40 (2) : 162 - 168
12345