TURING COMPLEXITY OF THE ORDINALS

被引：3
|
作者：
DEHORNOY, P
机构：
[1] Univ of Caen, Caen, Fr, Univ of Caen, Caen, Fr
来源：
INFORMATION PROCESSING LETTERS | 1986年 / 23卷 / 04期
关键词：
AUTOMATA THEORY - Turing Machines;
D O I：
10.1016/0020-0190(86)90130-4
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The ordinals arise as relevant tools for measuring the strength of some construction schemes, especially in recursion theory and logic. It is a very natural idea to try to define on the ordinals the Tuning complexity classes, for instance, the notion of a polynomial time computable ordinal, etc. It is shown that this approach is irrelevant for the hierarchies below the recursive level - at least when the question is raised in the same way it has been (successfully) raised in the literature for the hierarchies above the recursive level.
引用
收藏
页码：167 / 170
页数：4
相关论文
共 50 条
  • [21] On Kolmogorov complexity in the red Turing machine setting
    Montana, JL
    Pardo, LM
    INFORMATION PROCESSING LETTERS, 1998, 67 (02) : 81 - 86
  • [22] The Complexity of Small Universal Turing Machines: A Survey
    Neary, Turlough
    Woods, Damien
    SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 385 - +
  • [23] The complexity of small universal Turing machines: A survey
    Woods, Damien
    Neary, Turlough
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (4-5) : 443 - 450
  • [24] THE COMPLEXITY OF LINEAR-TIME TEMPORAL LOGIC OVER THE CLASS OF ORDINALS
    Demri, Stephane
    Rabinovich, Alexander
    LOGICAL METHODS IN COMPUTER SCIENCE, 2010, 6 (04) : 1 - 25
  • [25] SPACE COMPLEXITY OF ALTERNATING TURING-MACHINES
    ALBERTS, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 1 - 7
  • [26] Understanding the Computational Complexity of Diverse Classes of Turing and Super-Turing Computational Models
    Abdelmoumin, Ghada
    Liu, Chunmei
    Rawat, Danda
    2023 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE, CSCI 2023, 2023, : 411 - 419
  • [27] The complexity of proving chaoticity and the Church-Turing thesis
    Calude, Cristian S.
    Calude, Elena
    Svozil, Karl
    CHAOS, 2010, 20 (03)
  • [28] The second quantized quantum Turing machine and Kolmogorov complexity
    Rogers, Caroline
    Vedral, Vlatko
    MODERN PHYSICS LETTERS B, 2008, 22 (12): : 1203 - 1210
  • [29] Space and time complexity for infinite time Turing machines
    Carl, Merlin
    JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (06) : 1239 - 1255
  • [30] On two problems of turing complexity for strongly minimal theories
    S. S. Goncharov
    Doklady Mathematics, 2008, 77 : 438 - 440
12345