%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
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1968_182_6_a1/
%G ru
%F DAN_1968_182_6_a1