RUS  ENG
Full version
JOURNALS // Itogi Nauki i Tekhniki. Sovremennaya Matematika i ee Prilozheniya. Tematicheskie Obzory // Archive
Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 2018 Volume 157, Pages 8–41 (Mi into405)
This article is cited 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.

UDC: 510.6, 510.52, 510.53, 510.57

MSC: 03C57, 03D25, 03D28, 03D45, 03D55


 English version: Journal of Mathematical Sciences (New York), 2021, 256:1, 1–33

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025