Sophistication revisited

Theory of Computing Systems

Volumn 45, Issue 1, 2009, Pages 150-161

  Antunes, Luís ^a   Fortnow, Lance ^b  

^a UNIVERSITY OF PORTO   (Portugal)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

Kolmogorov complexity

Indexed keywords

AMOUNT OF INFORMATION; COMPUTATIONAL DEPTH; KOLMOGOROV; KOLMOGOROV COMPLEXITY; STRUCTURE FUNCTIONS;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 67349157320     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9095-5     Document Type: Article

References (17)

1. L. Antunes L. Fortnow D. van Melkebeek N. Vinodchandran 2006 Computational depth: Concept and applications Theor. Comput. Sci. 354 3 391 404 (Pubitemid 43344445)
2. Bennett, C.H.: Logical depth and physical complexity. In: Herken, R. (ed.) The Universal Turing Machine: A Half-Century Survey, pp. 227-257. Oxford University Press, London (1988)
3. G. Chaitin 1966 On the length of programs for computing finite binary sequences J. ACM 13 4 145 149
4. Cover, T.M.: Kolmogorov complexity, data compression, and inference. In: Skwirzynski, J.K. (ed.) The Impact of Processing Techniques on Communications, pp. 23-33. Nijhoff, Dordrecht (1985) (Pubitemid 17574964)
5. R. Daley 1982 Busy beaver sets: characterizations and applications Inf. Control 52 52 67
6. P. Gács J. Tromp P. Vitányi 2001 Algorithmic statistics IEEE Trans. Inf. Theory 47 6 2443 2463
7. A.N. Kolmogorov 1965 Three approaches to the quantitative definition of information Probl. Inf. Transm. 1 1 1 7
8. Koppel, M.: Structure. In: Herken, R. (ed.) The Universal Turing Machine: A Half-Century Survey, pp. 435-452. Oxford University Press, London (1988)
9. M. Koppel 1991 Learning to predict non-deterministically generated strings Mach. Learn. 7 85 99
10. M. Koppel H. Atlan 1991 An almost machine-independent theory of program-length complexity, sophistication, and induction Inf. Sci. 56 23 33
11. L. Levin 1973 Universal search problems Probl. Inf. Transm. 9 265 266
12. Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, Berlin (1997)
13. A. Shen 1983 The concept of (α,β)-stochasticity in the Kolmogorov sense, and its properties Sov. Math. Dokl. 28 295 299
14. R. Solomonoff 1964 A formal theory of inductive inference, part I Inf. Control 7 1 1 22
15. Vereshchagin, N., Vitányi, P.: Kolmogorov's structure functions and an application to the foundations of model selection. In: Proc. 47th IEEE Symp. Found. Comput. Sci. (2002)
16. P. Vitányi 2006 Meaningful information IEEE Trans. Inf. Theory 52 10 4617 4627 (Pubitemid 46445296)
17. V.V. V'yugin 1999 Algorithmic complexity and stochastic properties of finite binary sequences Comput. J. 42 4 294 317