Kolmogorov complexity: Sources, theory and applications

Computer Journal

Volumn 42, Issue 4, 1999, Pages 254-255

  Gammerman, Alexander ^a   Vovk, Vladimir ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; INFERENCE ENGINES; POLYNOMIALS; PROBABILITY; TURING MACHINES;

KOLMOGOROV COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0032684827     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/42.4.252     Document Type: Article

References (20)

1. Martin-Löf, P. (1966) The definition of random sequences. Information and Control, 9, 602-619.
2. Chaitin, G. J. (1966) On the length of programs for computing finite binary sequences. J. Assoc. Comput. Mach., 13, 547-569.
3. Chaitin, G. J. (1969) On the length of programs for computing finite binary sequences: statistical considerations. J. Assoc. Comput. Mach., 16, 145-159.
4. Li, M. and Vitdnyi, P. (1997) An Introduction to Kolmogorov Complexity and Its Applications (2nd edn). Springer, New York
5. Levin, L. A. (1974) Laws of information conservation (nongrowth) and aspects of the foundations of probability theory. Problems Inform. Transmission, 10, 206-210.
6. Gdcs, P. (1974) On the symmetry of algorithmic information. Sov. Math.-Dokl., 15, 1477-1480.
7. Chaitin, G. J. (1975) A theory of program size formally identical to information theory. J. Assoc. Comput. Mach., 22, 329-340.
8. Shen, A. ( 1984) Algorithmic variants of the notion of entropy. Sov. Math-Dokl, 29, 569-573.
9. Zvonkin, A. K. and Levin, L. A. (1970) The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Sun-eys, 25, 83-124.
10. Kolmogorov, A. N. (1968) Logical basis for information theory and probability theory. IEEE Trans. Inform. Theory, IT-14,662-664.
11. Kolmogorov, A. N. (1983) Combinatorial foundations of information theory and the calculus of probabilities. Russian Math. Sun-eys, 38, 29.
12. Kolmogorov, A. N. (1933) Grundbegriffe der Wahrscheinlichkeitsrechnung. Springer, Berlin. Published in English as Foundations of the Theory of Probability. Chelsea, New York. 1st edn, 1950; 2nd edn, 1956.
13. V'yugin, V. V. (1994) Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information. Selecta Mathematica Sovietica, 13, 357-389.
14. Uspensky, V. A. and Semenov, A. L. (1993) Algorithms: Main Ideas and Applications. Kluwer, Dordrecht.
15. Rissanen, J. (1978) Modeling by the shortest data description. Automatica, 14,465-471.
16. Rissanen, J. (1983) A universal prior for integers and estimation by minimum description length. Ann. Statist., 11, 416-431.
17. Rissanen, J. (1987) Stochastic complexity (with discussion). J. R. Statist. Soc., B, 49, 223-239 and 252-265.
18. Rissanen, J. (1989) Stochastic Complexity and Statistical Inquiry. World Scientific, Singapore.
19. Wallace, C. S. and Boulton, D. M. (1968) An information measure for classification. Comput. J., 11, 185-195.
20. Wallace, C. S. and Freeman, P. R. (1987) Estimation and inference by compact coding (with discussion). J. R. Statist. Soc. B, 49, 240-265.