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, 1971, Volume 199, Number 2, Pages 262–264 (Mi dan36272)  
MATHEMATICS

Complexity and accuracy of the solution of initial segments of the problem of occurrence in a recursively enumerable set

J. M. Barzdiņš

University of Latvia, Computing Center, Riga
Full-text PDF (378 kB)
Presented: A. N. Kolmogorov
Received: 23.12.1970
Bibliographic databases:
Document Type: Article
UDC: 51.01:518.5
Language: Russian
Citation: J. M. Barzdiņš, “Complexity and accuracy of the solution of initial segments of the problem of occurrence in a recursively enumerable set”, Dokl. Akad. Nauk SSSR, 199:2 (1971), 262–264
Citation in format AMSBIB
\Bibitem{Bar71}
\by J.~M.~Barzdi{\c n}{\v s}
\paper Complexity and accuracy of the solution of initial segments of the problem of occurrence in a recursively enumerable set
\jour Dokl. Akad. Nauk SSSR
\yr 1971
\vol 199
\issue 2
\pages 262--264
\mathnet{http://mi.mathnet.ru/dan36272}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0289293}
\zmath{https://zbmath.org/?q=an:0242.02045}
Linking options:
  • https://www.mathnet.ru/eng/dan36272
  • https://www.mathnet.ru/eng/dan/v199/i2/p262
    • 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