Discussion on Kolmogorov complexity and statistical analysis

Computer Journal

Volumn 42, Issue 4, 1999, Pages 340-342

  Shen, Alexander ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; PROBABILITY; STATISTICAL METHODS;

KOLMOGOROV COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0032685680     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/42.4.340     Document Type: Article

References (7)

1. Uspensky, V. A. and Shen, A. (1996) Relations between varieties of Kolmogorov complexities. Math. Systems Theory. 29, 271-292.
2. Shen, A. (1983) The concept of (α, β)-stochasticity and its properties. Sov. Math.-Dokl., 28, 295-299.
3. Rissanen, J. (1999) Hypotheses selection and testing by the MDL principle. Comput. J., 42, 260-269.
4. Luby, M. (1996) Pseudorandomness and Cryptographic Applications. Princeton University Press, Princeton, NJ.
5. Uspensky, V. A., Semenov, A. L. and Shen, A. (1990) Can an individual sequences of zeros and ones be random? Russian Math. Surveys, 45, 121-189.
6. Li, M. and Vitányi, P. (1997) An Introduction to Kolmogorov Complexity and its Applications (2nd edn). Springer, New York.
7. Wallace, C. S. and Dowe, D. L. (1999) Minimum message length and Kolmogorov complexity. Comput. J., 42, 270-283.