Zapiski Nauchnykh Seminarov LOMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




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

Zapiski Nauchnykh Seminarov LOMI, 1976, Volume 60, Pages 29–37 (Mi znsl2067)  
This article is cited in 8 scientific papers (total in 8 papers)

Kolmogoroff algorithms are stronger than turing machines

D. Yu. Grigor'ev
Full-text PDF (440 kB) Citations (8)
Abstract: A predicate is constructed which is recognizable in real time by a Kolmogoroff algorithm but which is not recognizable in real time by a machine with polynomial accessibility.
English version:
Journal of Soviet Mathematics, 1980, Volume 14, Issue 5, Pages 1445–1450
DOI: https://doi.org/10.1007/BF01693975
Bibliographic databases:
UDC: 518.5
Language: Russian
Citation: D. Yu. Grigor'ev, “Kolmogoroff algorithms are stronger than turing machines”, Studies in constructive mathematics and mathematical logic. Part VII, Zap. Nauchn. Sem. LOMI, 60, "Nauka", Leningrad. Otdel., Leningrad, 1976, 29–37; J. Soviet Math., 14:5 (1980), 1445–1450
Citation in format AMSBIB
\Bibitem{Gri76}
\by D.~Yu.~Grigor'ev
\paper Kolmogoroff algorithms are stronger than turing machines
\inbook Studies in constructive mathematics and mathematical logic. Part~VII
\serial Zap. Nauchn. Sem. LOMI
\yr 1976
\vol 60
\pages 29--37
\publ "Nauka", Leningrad. Otdel.
\publaddr Leningrad
\mathnet{http://mi.mathnet.ru/znsl2067}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=536657}
\zmath{https://zbmath.org/?q=an:0449.03030|0345.02023}
\transl
\jour J. Soviet Math.
\yr 1980
\vol 14
\issue 5
\pages 1445--1450
\crossref{https://doi.org/10.1007/BF01693975}
Linking options:
  • https://www.mathnet.ru/eng/znsl2067
  • https://www.mathnet.ru/eng/znsl/v60/p29
    • This publication is cited in the following 8 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:326
    Full-text PDF :154
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024