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, 1968, Volume 182, Number 6, Pages 1249–1252 (Mi dan34200)  
This article is cited in 4 scientific papers (total in 4 papers)

MATHEMATICS

Complexity of programs which recognize whether natural numbers not exceeding $n$ belong to a recursively enumerable set

J. M. Barzdiņš

Computing Center of the Latvian State University
Full-text PDF (628 kB) Citations (4)
Presented: A. N. Kolmogorov
Received: 07.06.1968
Bibliographic databases:
Document Type: Article
UDC: 51.01:518.5
Language: Russian
Citation: J. M. Barzdiņš, “Complexity of programs which recognize whether natural numbers not exceeding $n$ belong to a recursively enumerable set”, Dokl. Akad. Nauk SSSR, 182:6 (1968), 1249–1252
Citation in format AMSBIB
\Bibitem{Bar68}
\by J.~M.~Barzdi{\c n}{\v s}
\paper Complexity of programs which recognize whether natural numbers not exceeding $n$~belong to a recursively enumerable set
\jour Dokl. Akad. Nauk SSSR
\yr 1968
\vol 182
\issue 6
\pages 1249--1252
\mathnet{http://mi.mathnet.ru/dan34200}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0236009}
\zmath{https://zbmath.org/?q=an:0193.31601}
Linking options:
  • https://www.mathnet.ru/eng/dan34200
  • https://www.mathnet.ru/eng/dan/v182/i6/p1249
    • This publication is cited in the following 4 articles:
    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, 2025