Geodesic
Complexity of programs which recognize whether natural numbers not exceeding $n$ belong to a recursively enumerable set
Doklady Akademii Nauk, Tome 182 (1968) no. 6, pp. 1249-1252 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DAN_1968_182_6_a1,
     author = {J. M. Barzdi\c{n}\v{s}},
     title = {Complexity of programs which recognize whether natural numbers not exceeding $n$~belong to a recursively enumerable set},
     journal = {Doklady Akademii Nauk},
     pages = {1249--1252},
     year = {1968},
     volume = {182},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1968_182_6_a1/}
}
TY  - JOUR
AU  - J. M. Barzdiņš
TI  - Complexity of programs which recognize whether natural numbers not exceeding $n$ belong to a recursively enumerable set
JO  - Doklady Akademii Nauk
PY  - 1968
SP  - 1249
EP  - 1252
VL  - 182
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/DAN_1968_182_6_a1/
LA  - ru
ID  - DAN_1968_182_6_a1
ER  - 
%0 Journal Article
%A J. M. Barzdiņš
%T Complexity of programs which recognize whether natural numbers not exceeding $n$ belong to a recursively enumerable set
%J Doklady Akademii Nauk
%D 1968
%P 1249-1252
%V 182
%N 6
%U http://geodesic.mathdoc.fr/item/DAN_1968_182_6_a1/
%G ru
%F DAN_1968_182_6_a1
J. M. Barzdiņš. Complexity of programs which recognize whether natural numbers not exceeding $n$ belong to a recursively enumerable set. Doklady Akademii Nauk, Tome 182 (1968) no. 6, pp. 1249-1252. http://geodesic.mathdoc.fr/item/DAN_1968_182_6_a1/