Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
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, 1970, Volume 192, Number 4, Pages 721–723 (Mi dan35438)  
MATHEMATICS

The complexity of the solution of recursively enumerable sets

M. I. Kanovitch

Lomonosov Moscow State University
Full-text PDF (469 kB)
Presented: P. S. Novikov
Received: 27.11.1969
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: M. I. Kanovitch, “The complexity of the solution of recursively enumerable sets”, Dokl. Akad. Nauk SSSR, 192:4 (1970), 721–723
Citation in format AMSBIB
\Bibitem{Kan70}
\by M.~I.~Kanovitch
\paper The complexity of the solution of recursively enumerable sets
\jour Dokl. Akad. Nauk SSSR
\yr 1970
\vol 192
\issue 4
\pages 721--723
\mathnet{http://mi.mathnet.ru/dan35438}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0265155}
\zmath{https://zbmath.org/?q=an:0272.02055}
Linking options:
  • https://www.mathnet.ru/eng/dan35438
  • https://www.mathnet.ru/eng/dan/v192/i4/p721
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024