This is a preview of subscription content, log in via an institution to check access.
References
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–11
Rogers, H. Jr., Theory of recursive functions and effective computability. McGraw-Hill, New York, 1967
Markov, A. A., The theory of algorithms. Trudy Mat. Inst. Steklov 42 (1954)
Kanovič, M. I., Complexity of the decision of an enumerable set as a criterion of its universality. Soviet Math. Dokl. 11 (1970) 1224–1228
Kanovič, M.I., Dekker's construction and effective nonrecursiveness. Soviet Math. Dokl. 16 (1975) 719–721
Kanovič, M. I., On exactness of the complexity criterion of non-recursiveness and universality. Dokl. Akad. Nauk SSSR 232 (1977) 1249–1252
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanovič, M.I. (1977). On computability of Kolmogorov complexity. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_110
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive