Generalized computable universal numberings
Algebra i logika, Tome 53 (2014) no. 5, pp. 555-569

Voir la notice de l'article provenant de la source Math-Net.Ru

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, universal computable numbering.
Mots-clés : oracle
@article{AL_2014_53_5_a0,
     author = {S. A. Badaev and S. S. Goncharov},
     title = {Generalized computable universal numberings},
     journal = {Algebra i logika},
     pages = {555--569},
     publisher = {mathdoc},
     volume = {53},
     number = {5},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2014_53_5_a0/}
}
TY  - JOUR
AU  - S. A. Badaev
AU  - S. S. Goncharov
TI  - Generalized computable universal numberings
JO  - Algebra i logika
PY  - 2014
SP  - 555
EP  - 569
VL  - 53
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2014_53_5_a0/
LA  - ru
ID  - AL_2014_53_5_a0
ER  - 
%0 Journal Article
%A S. A. Badaev
%A S. S. Goncharov
%T Generalized computable universal numberings
%J Algebra i logika
%D 2014
%P 555-569
%V 53
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2014_53_5_a0/
%G ru
%F AL_2014_53_5_a0
S. A. Badaev; S. S. Goncharov. Generalized computable universal numberings. Algebra i logika, Tome 53 (2014) no. 5, pp. 555-569. http://geodesic.mathdoc.fr/item/AL_2014_53_5_a0/