RUS  ENG
Full version
JOURNALS // Doklady Akademii Nauk // Archive

Dokl. Akad. Nauk SSSR, 1970 Volume 194, Number 3, Pages 500–503 (Mi dan35679)

MATHEMATICS

Complexity of the decidability of an enumerable set as a criterion of its universality

M. I. Kanovich

Lomonosov Moscow State University

UDC: 517.11

Presented: A. A. Dorodnitsyn
Received: 04.03.1970



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024