RUS
ENG
Full version
JOURNALS
// Doklady Akademii Nauk
// Archive
Dokl. Akad. Nauk SSSR,
1982
Volume 267,
Number 6,
Pages
1300–1304
(Mi dan45816)
MATHEMATICS
On the complexity of the problem of separating recursively enumerable sets
M. I. Kanovitch
Kalininsky State University
UDC:
517.11
Presented:
A. N. Kolmogorov
Received: 24.03.1982
Fulltext:
PDF file (690 kB)
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026