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, 1968, Volume 8, Pages 225–233 (Mi znsl2267)  
A complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm

R. I. Freidson
Full-text PDF (378 kB)
Bibliographic databases:
Language: Russian
Citation: R. I. Freidson, “A complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm”, Studies in constructive mathematics and mathematical logic. Part II, Zap. Nauchn. Sem. LOMI, 8, "Nauka", Leningrad. Otdel., Leningrad, 1968, 225–233
Citation in format AMSBIB
\Bibitem{Fre68}
\by R.~I.~Freidson
\paper A~complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm
\inbook Studies in constructive mathematics and mathematical logic. Part~II
\serial Zap. Nauchn. Sem. LOMI
\yr 1968
\vol 8
\pages 225--233
\publ "Nauka", Leningrad. Otdel.
\publaddr Leningrad
\mathnet{http://mi.mathnet.ru/znsl2267}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=272623}
\zmath{https://zbmath.org/?q=an:0205.01401}
Linking options:
  • https://www.mathnet.ru/eng/znsl2267
  • https://www.mathnet.ru/eng/znsl/v8/p225
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:157
    Full-text PDF :74
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024