|
Itogi Nauki i Tekhniki. Sovremennaya Matematika i ee Prilozheniya. Tematicheskie Obzory, 2018, Volume 157, Pages 8–41
(Mi into405)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Turing computability: structural theory
M. M. Arslanov, M. M. Yamaleev Kazan (Volga Region) Federal University
Abstract:
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.
Keywords:
computably enumerable set, Turing degree, Ershov's hierarchy, definability.
Citation:
M. M. Arslanov, M. M. Yamaleev, “Turing computability: structural theory”, Proceedings of the Seminar on Algebra and Mathematical Logic of the Kazan (Volga Region) Federal University, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 157, VINITI, Moscow, 2018, 8–41; J. Math. Sci. (N. Y.), 256:1 (2021), 1–33
Linking options:
https://www.mathnet.ru/eng/into405 https://www.mathnet.ru/eng/into/v157/p8
|
Statistics & downloads: |
Abstract page: | 259 | Full-text PDF : | 114 | References: | 29 | First page: | 9 |
|