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
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1968_182_6_a1/
LA  - ru
ID  - DAN_1968_182_6_a1
ER  -