Effective complexity and its relation to logical depth

IEEE Transactions on Information Theory

Volumn 56, Issue 9, 2010, Pages 4593-4607

  Ay, Nihat ^a   Müller, Markus ^a,b   Szkoła, Arleta ^a  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Algorithmic information content; algorithmic statistics; Bennett's logical depth; effective complexity; Kolmogorov complexity; Kolmogorov minimal sufficient statistics; Shannon entropy; sophistication

Indexed keywords

ALGORITHMIC STATISTICS; BENNETT'S LOGICAL DEPTH; EFFECTIVE COMPLEXITY; INFORMATION CONTENTS; KOLMOGOROV; KOLMOGOROV COMPLEXITY; SHANNON ENTROPY; SOPHISTICATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENTROPY; INFORMATION THEORY; STATISTICS;

PARALLEL PROCESSING SYSTEMS;

EID: 77955719279     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2053892     Document Type: Article

References (14)

1. M. Li and P. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications. New York: Springer-Verlag, 1997.
2. M. Gell-Mann and S. Lloyd, Effective Complexity pp. 387-398, 2003, Santa Fe Institute.
3. M. Gell-Mann and S. Lloyd, "Information measures, effective complexity, and total information," Complexity, vol.2, pp. 44-52, 1996.
4. C. Bennett, "Logical Depth and Physical Complexity," in The Universal Turing Machine-A Half-Century Survey, R. Herken, Ed. Oxford, U.K.: Oxford Univ. Press, 1988.
5. J. Rissanen, Stochastic Complexity in Statistical Inquiry, ser. Series in Computer Science. Singapore: World Scientific, 1998, vol.15.
6. J. Rissanen, Information and Complexity in Statistical Modeling. New York: Springer, 2007.
7. M.Koppel, "Structure," in The Universal Turing Machine: A Half-Century Survey, R. Herken, Ed. Oxford, U.K.: Oxford Univ. Press, 1988, pp. 235-252.
8. P. Gács, J. T. Tromp, and P. M. B. Vitányi, "Algorithmic statistics," IEEE Trans. Inf. Theory, vol.47/6, pp. 2443-2463, 2001.
9. P. M. Vitányi, "Meaningful information," IEEE Trans. Inf. Theory, vol.52/10, pp. 4617-4626, 2006.
10. L. Antunes and L. Fortnow, "Sophistication revisited," Theory of Comput. Syst., vol.45/1, pp. 150-161, 2009.
11. S. Lloyd, "Measures of complexity: A nonexhaustive list," IEEE Contr. Syst. Mag., vol.21/4, pp. 7-8, 2001.
12. G. J. Chaitin, Exploring Randomness. London, U.K.: Springer- Verlag, 2001.
13. T. M. Cover and J. A. Thomas, Elements of Information Theory, ser. Wiley Series in Telecommun.. New York: Wiley, 1991.
14. N. Ay, M. Müller, and A. Szköa, Effective Complexity of Stationary Process Realizations arXiv:1001.2686, submitted 2009.