Geodesic
Complexity of bounded decidability of semirecursively enumerable sets
Doklady Akademii Nauk, Tome 203 (1972) no. 6, pp. 1246-1248.

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

@article{DAN_1972_203_6_a5,
     author = {M. I. Kanovitch},
     title = {Complexity of bounded decidability of semirecursively enumerable sets},
     journal = {Doklady Akademii Nauk},
     pages = {1246--1248},
     publisher = {mathdoc},
     volume = {203},
     number = {6},
     year = {1972},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1972_203_6_a5/}
}
TY  - JOUR
AU  - M. I. Kanovitch
TI  - Complexity of bounded decidability of semirecursively enumerable sets
JO  - Doklady Akademii Nauk
PY  - 1972
SP  - 1246
EP  - 1248
VL  - 203
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1972_203_6_a5/
LA  - ru
ID  - DAN_1972_203_6_a5
ER  - 
%0 Journal Article
%A M. I. Kanovitch
%T Complexity of bounded decidability of semirecursively enumerable sets
%J Doklady Akademii Nauk
%D 1972
%P 1246-1248
%V 203
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1972_203_6_a5/
%G ru
%F DAN_1972_203_6_a5
M. I. Kanovitch. Complexity of bounded decidability of semirecursively enumerable sets. Doklady Akademii Nauk, Tome 203 (1972) no. 6, pp. 1246-1248. http://geodesic.mathdoc.fr/item/DAN_1972_203_6_a5/