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




Doklady Akademii Nauk SSSR, 1969, Volume 185, Number 6, Pages 1232–1235 (Mi dan34572)  
MATHEMATICS

A certain method of proof of unsolvability of algorithmic problems

Yu. T. Medvedev

V. A. Steklov Mathematical Institute, USSR Academy of Sciences
Full-text PDF (658 kB)
Presented: A. N. Kolmogorov
Received: 20.08.1968
Bibliographic databases:
Document Type: Article
UDC: 51.01:518.5
Language: Russian
Citation: Yu. T. Medvedev, “A certain method of proof of unsolvability of algorithmic problems”, Dokl. Akad. Nauk SSSR, 185:6 (1969), 1232–1235
Citation in format AMSBIB
\Bibitem{Med69}
\by Yu.~T.~Medvedev
\paper A certain method of proof of unsolvability of algorithmic problems
\jour Dokl. Akad. Nauk SSSR
\yr 1969
\vol 185
\issue 6
\pages 1232--1235
\mathnet{http://mi.mathnet.ru/dan34572}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0250880}
\zmath{https://zbmath.org/?q=an:0193.31602}
Linking options:
  • https://www.mathnet.ru/eng/dan34572
  • https://www.mathnet.ru/eng/dan/v185/i6/p1232
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:183
    Full-text PDF :104
    References:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025