Geodesic
Complexity and accuracy of the solution of initial segments of the problem of occurrence in a recursively enumerable set
Doklady Akademii Nauk, Tome 199 (1971) no. 2, pp. 262-264 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DAN_1971_199_2_a2,
     author = {J. M. Barzdi\c{n}\v{s}},
     title = {Complexity and accuracy of the solution of initial segments of the problem of occurrence in a recursively enumerable set},
     journal = {Doklady Akademii Nauk},
     pages = {262--264},
     year = {1971},
     volume = {199},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1971_199_2_a2/}
}
TY  - JOUR
AU  - J. M. Barzdiņš
TI  - Complexity and accuracy of the solution of initial segments of the problem of occurrence in a recursively enumerable set
JO  - Doklady Akademii Nauk
PY  - 1971
SP  - 262
EP  - 264
VL  - 199
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DAN_1971_199_2_a2/
LA  - ru
ID  - DAN_1971_199_2_a2
ER  - 
%0 Journal Article
%A J. M. Barzdiņš
%T Complexity and accuracy of the solution of initial segments of the problem of occurrence in a recursively enumerable set
%J Doklady Akademii Nauk
%D 1971
%P 262-264
%V 199
%N 2
%U http://geodesic.mathdoc.fr/item/DAN_1971_199_2_a2/
%G ru
%F DAN_1971_199_2_a2
J. M. Barzdiņš. Complexity and accuracy of the solution of initial segments of the problem of occurrence in a recursively enumerable set. Doklady Akademii Nauk, Tome 199 (1971) no. 2, pp. 262-264. http://geodesic.mathdoc.fr/item/DAN_1971_199_2_a2/