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 条
  • [1] Effectivity and reducibility with ordinal Turing machines
    Carl, Merlin
    COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2021, 10 (04): : 289 - 304
  • [2] The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters
    Carl, Merlin
    Schlicht, Philipp
    UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017, 2017, 10307 : 198 - 209
  • [3] Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum-Shub-Smale machines
    Welch, Philip
    COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2021, 10 (02): : 159 - 180
  • [4] Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
    Burgin, Mark
    Eberbach, Eugene
    FUNDAMENTA INFORMATICAE, 2009, 91 (01) : 53 - 77
  • [5] Alan Turing, Turing Machines and Stronger
    Gams, Matjaz
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2013, 37 (01): : 9 - 14
  • [6] Simulating Turing machines on Maurer machines
    Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, Netherlands
    不详
    J. Appl. Logic, 2008, 1 (1-23):
  • [7] DEFINABILITY BY TURING MACHINES
    BAER, RM
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1969, 15 (04): : 325 - &
  • [8] Turing Machines as Conscious Computing Machines
    Krol, Jerzy
    Schumann, Andrew
    INFORMATION SYSTEMS AND TECHNOLOGIES, VOL 4, WORLDCIST 2023, 2024, 802 : 400 - 410
  • [9] ON FORMALISMS FOR TURING MACHINES
    FISCHER, PC
    JOURNAL OF THE ACM, 1965, 12 (04) : 570 - &
  • [10] TURING-MACHINES
    HOPCROFT, JE
    SCIENTIFIC AMERICAN, 1984, 250 (05) : 86 - &
12345