On computability of Kolmogorov complexity

  • Max I. Kanovič
Section C Computability, Decidability & Arithmetic Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Nauk SSSR Optimal Algorithm Mathematical Logic Recursive Function Soviet Math 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Kolmogorov, A. N., Three approaches to the definition of the concept of the "amount of information". Problemy Peredači Informacii, 1 (1965) no. 1, 3–11Google Scholar
  2. 2.
    Rogers, H. Jr., Theory of recursive functions and effective computability. McGraw-Hill, New York, 1967Google Scholar
  3. 3.
    Markov, A. A., The theory of algorithms. Trudy Mat. Inst. Steklov 42 (1954)Google Scholar
  4. 4.
    Kanovič, M. I., Complexity of the decision of an enumerable set as a criterion of its universality. Soviet Math. Dokl. 11 (1970) 1224–1228Google Scholar
  5. 5.
    Kanovič, M.I., Dekker's construction and effective nonrecursiveness. Soviet Math. Dokl. 16 (1975) 719–721Google Scholar
  6. 6.
    Kanovič, M. I., On exactness of the complexity criterion of non-recursiveness and universality. Dokl. Akad. Nauk SSSR 232 (1977) 1249–1252Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Max I. Kanovič
    • 1
  1. 1.Kalinin State UniversityKalininUSSR

Personalised recommendations