|
Itogi Nauki i Tekhniki. Sovremennaya Matematika i ee Prilozheniya. Tematicheskie Obzory, 2018, Volume 157, Pages 106–134
(Mi into409)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Precomplete numberings
V. L. Selivanovab a A.P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b Kazan (Volga Region) Federal University
Abstract:
In this survey, we discuss the theory of precomplete numberings which appear frequently in computability theory. Precomplete numberings are closely related to some variants of fixed point theorem having an important methodological value. This sometimes permits to eliminate cumbersome proofs involving the so called priority method in favour of elegant and simple applications of this theorem. In a sense, this paper covers the part of computability theory that may be developed by elementary methods.
Keywords:
numbering, precomplete numbering, complete numbering, universality, reducibility, hierarchy, index set.
Citation:
V. L. Selivanov, “Precomplete numberings”, 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, 106–134; J. Math. Sci. (N. Y.), 256:1 (2021), 96–124
Linking options:
https://www.mathnet.ru/eng/into409 https://www.mathnet.ru/eng/into/v157/p106
|
Statistics & downloads: |
Abstract page: | 209 | Full-text PDF : | 142 | References: | 14 | First page: | 6 |
|