M. I. Kanovitch, “On the complexity of the problem of separating recursively enumerable sets”, Dokl. Akad. Nauk SSSR, 267:6 (1982), 1300

Doklady Akademii Nauk SSSR

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Doklady Akademii 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

Full-text PDF (690 kB)

Presented: A. N. Kolmogorov
Received: 24.03.1982

Bibliographic databases:

Document Type: Article

UDC: 517.11

Language: Russian

Citation: M. I. Kanovitch, “On the complexity of the problem of separating recursively enumerable sets”, Dokl. Akad. Nauk SSSR, 267:6 (1982), 1300–1304

Citation in format AMSBIB

\Bibitem{Kan82}

\by M.~I.~Kanovitch

\paper On the complexity of the problem of separating recursively enumerable sets

\jour Dokl. Akad. Nauk SSSR

\yr 1982

\vol 267

\issue 6

\pages 1300--1304

\mathnet{http://mi.mathnet.ru/dan45816}

\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0687905}

\zmath{https://zbmath.org/?q=an:0573.03013}

Linking options:

https://www.mathnet.ru/eng/dan45816

https://www.mathnet.ru/eng/dan/v267/i6/p1300

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Registration to the website

Logotypes