|
This article is cited in 24 scientific papers (total in 24 papers)
Generalized computable universal numberings
S. A. Badaeva, S. S. Goncharovbc a Al-Farabi Kazakh National University, Al-Farabi ave. 71, Alma-Ata, 050038, Kazakhstan
b Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia
c Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia
Abstract:
We aim to consider the notion of a computable numbering as a uniform enumeration of sets of a family relative to an arbitrary oracle. The questions under investigation concern primarily universal computable numberings. A study of this kind of numberings is mostly motivated by their nature since any universal numbering of a family contains information on all its computable numberings.
Keywords:
computability, oracle, universal computable numbering.
Received: 26.02.2014
Citation:
S. A. Badaev, S. S. Goncharov, “Generalized computable universal numberings”, Algebra Logika, 53:5 (2014), 555–569; Algebra and Logic, 53:5 (2014), 355–364
Linking options:
https://www.mathnet.ru/eng/al650 https://www.mathnet.ru/eng/al/v53/i5/p555
|
Statistics & downloads: |
Abstract page: | 426 | Full-text PDF : | 146 | References: | 56 | First page: | 13 |
|