Turing Computability: Structural Theory

被引：0
|
作者：
Arslanov M.M. [1 ]
Yamaleev M.M. [1 ]
机构：
[1] Kazan (Volga Region) Federal University, Kazan
来源：
Journal of Mathematical Sciences | 2021年 / 256卷 / 1期
关键词：
03C57; 03D25; 03D28; 03D45; 03D55; computably enumerable set; definability; Ershov’s hierarchy; Turing degree;
D O I：
10.1007/s10958-021-05418-y
中图分类号：
学科分类号：
摘要：
In this work, we review results of the last years related to the development of the structural theory of n-c.e. Turing degrees for n > 1. We also discuss possible approaches to solution of the open problems. © 2021, Springer Science+Business Media, LLC, part of Springer Nature.
引用
收藏
页码：1 / 33
页数：32
相关论文
共 50 条
  • [1] THE PRESENT THEORY OF TURING MACHINE COMPUTABILITY
    ROGERS, H
    [J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1959, 7 (01): : 114 - 130
  • [2] Feedback Turing Computability, and Turing Computability as Feedback
    Ackerman, Nathanael L.
    Freer, Cameron E.
    Lubarsky, Robert S.
    [J]. 2015 30TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2015, : 523 - 534
  • [3] COMPUTABILITY AND TYPE THEORY - TURING CONTRIBUTION TO TYPE THEORY
    HARRELL, M
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 322 - 322
  • [4] Mechanising Turing Machines and Computability Theory in Isabelle/HOL
    Xu, Jian
    Zhang, Xingyuan
    Urban, Christian
    [J]. INTERACTIVE THEOREM PROVING, ITP 2013, 2013, 7998 : 147 - 162
  • [5] Transcending Turing computability
    Maclennan, BJ
    [J]. MINDS AND MACHINES, 2003, 13 (01) : 3 - 22
  • [6] Transcending Turing Computability
    B.J. Maclennan
    [J]. Minds and Machines, 2003, 13 : 3 - 22
  • [7] TURING'S ALGORITHMIC LENS: FROM COMPUTABILITY TO COMPLEXITY THEORY
    Diaz, Josep
    Torras, Carme
    [J]. ARBOR-CIENCIA PENSAMIENTO Y CULTURA, 2013, 189 (764)
  • [8] Parallel Feedback Turing Computability
    Lubarsky, Robert S.
    [J]. LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS 2016), 2016, 9537 : 236 - 250
  • [9] An introduction to feedback Turing computability
    Ackerman, Nathanael L.
    Freer, Cameron E.
    Lubarsky, Robert S.
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (01) : 27 - 60
  • [10] SIMPLE GENERALIZATION OF TURING COMPUTABILITY
    THOMAS, WJ
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1974, 39 (02) : 396 - 397
12345