Relations between varieties of kolmogorov complexities

Theory of Computing Systems

Volumn 29, Issue 3, 1996, Pages 271-292

  Uspensky, V A ^a   Shen, A ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY;

KOLMOGOROV; KOLMOGOROV ENTROPIES; KOLMOGOROV COMPLEXITY; OPTIMAL MODES; UPPER AND LOWER BOUNDS;

BINARY SEQUENCES;

EID: 8744282544     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01201280     Document Type: Article

References (27)

1. C. Calude, Information and Randomness. An Algorithmic Perspective. Springer-Verlag, Auckland, in press.
2. G. J. Chaitin, On the length of programs for computing finite binary sequences, J. Assoc. Comput. Mach., 13 (1966), 547-569.
3. G. J. Chaitin, On the length of programs for computing finite binary sequences: statistical considerations, J. Assoc. Comput. Mach., 16 (1969), 145-159.
4. G. J. Chaitin, A theory of program size formally identical to information theory, J. Assoc. Comput. Mach., 22 (1975), 329-340.
5. G. J. Chaitin, Algorithmic Information Theory, Cambridge University Press, Cambridge, 1987.
6. G. J. Chaitin, Information, Randomness and Incompleteness. Papers on Algorithmic Information Theory, World Scientific, Singapore, 1987; expanded second edition in 1992.
7. G. J. Chaitin, Foreword to [1].
8. P. Gács, On the symmetry of algorithmic information, Soviet Math. Dokl., 15 (1974), 1477-1480. (Translated from the Russian version.)
9. P. Gács, On the relation between descriptional complexity and algorithmic probability. Theoret. Comput. SCi., 22 (1983), 71-93.
10. P. Gács, A review of [5], J. Symbolic Logic, 54(2) (1989), 624-627.
11. P. Gács, Personal communication, April, 1993.
12. A. N. Kolmogorov, Three approaches to the quantitative definition of information, Problems Inform. Transmission, 1(1) (1965), 1-7. (Translated from the Russian version.)
13. L. A. Levin, On the notion of a random sequence, Soviet Math. Dokl., 14 (1973), 1413-1416. (Translated from the Russian version.)
14. L. A. Levin, Laws of information conservation (non-growth) and aspects of the foundation of probability theory, Problems Inform. Transmission, 10(3) (1974), 206-210. (Translated from the Russian version.)
15. L. A. Levin, Various measures of complexity for finite objects (axiomatic description), Soviet Math. Dokl., 17 (1976), 522-526. (Translated from the Russian version.)
16. M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, New York, 1993.
17. D. W. Loveland, A variant of the Kolmogorov concept of complexity. Inform, and Control, 15 (1969), 602-619.
18. A. A. Markov, On normal algorithms which compute Boolean functions, Soviet Math. Dokl., 5 (1964), 922-924. (Translated from the Russian version.)
19. C. P. Schnorr, Process complexity and effective random tests, J. Comput. System Sci., 7 (1973), 376-388.
20. C. P. Schnorr, A survey of the theory of random sequences. In R. E. Butts and J. Hintikka (eds.), Basic Problems in Methodology and Linguistics, Reidel, Dordrecht, 1977, pp. 193-210.
21. A. Kh. Shen, Algorithmic variants of the notion of entropy. Soviet Math. Dokl, 29(3) (1984), 569-573. (Translated from the Russian version.)
22. R. Solomonoff. A formal theory of inductive inference, Part I, Inform. and Control, 7(1964), 1-22.
23. V. A. Uspensky, Complexity and entropy: an introduction to the theory of Kolmogorov complexity. In O. Watanabe (ed.), Kolmogorov Complexity and Computational Complexity, Springer-Verlag, New York, 1992.
24. V. A. Uspensky, A. L. Semenov, and A. Kh. Shen, Can an individual sequence of zeros and ones be random?, Russian Math. Surveys, 45(1) (1990), 121-189. (Translated from the Russian version.)
25. V. V. V'yugin. Algorithmic entropy (complexity) of finite objects and its application to defining randomness and amount of information, Semiotika i Informatika, 16 (1981), 14-43. (English translation: Selecta Mathematica formerly Sovietica, 13(4) (1994), 357-389.)
26. V. V. V'yugin. Algorithmic entropy (complexity) of finite objects and its application to defining randomness and amount of information, Semiotika i Informatika, 16 (1981), 14-43. (English translation: Selecta Mathematica formerly Sovietica, 13(4) (1994), 357-389.)
27. A. K. Zvonkin and L. A. Levin, The complexity of finite objects and the developments of the concepts of information and randomness by means of the theory of algorithms, Russian Math. Surveys, 25(6) (1970), 83-124. (Translated from the Russian version.)