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, 1982, Volume 264, Number 1, Pages 19–23 (Mi dan45265)  
MATHEMATICS

Generalized Kolmogorov complexity and duality in computational theory

M. S. Burgin

State Institute of Design agricultural machinery factories "Giproselmash", Kiev
Full-text PDF (770 kB)
Presented: A. N. Kolmogorov
Received: 10.11.1981
Bibliographic databases:
Document Type: Article
UDC: 51.01:518.5
Language: Russian
Citation: M. S. Burgin, “Generalized Kolmogorov complexity and duality in computational theory”, Dokl. Akad. Nauk SSSR, 264:1 (1982), 19–23
Citation in format AMSBIB
\Bibitem{Bur82}
\by M.~S.~Burgin
\paper Generalized Kolmogorov complexity and duality in computational theory
\jour Dokl. Akad. Nauk SSSR
\yr 1982
\vol 264
\issue 1
\pages 19--23
\mathnet{http://mi.mathnet.ru/dan45265}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0655481}
\zmath{https://zbmath.org/?q=an:0511.03016}
Linking options:
  • https://www.mathnet.ru/eng/dan45265
  • https://www.mathnet.ru/eng/dan/v264/i1/p19
    • 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