This article is cited in 4 papers

MATHEMATICS

Complexity of programs which recognize whether natural numbers not exceeding $n$ belong to a recursively enumerable set

J. M. Barzdiņš

Computing Center of the Latvian State University

UDC: 51.01:518.5

Presented: A. N. Kolmogorov
Received: 07.06.1968

Bibliographic databases:

• 
•