Fetching the paper…
Reading the bibliography…
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity.
A formal theory of inductive inference, part 1 and part 2
Solomonoff, R. (1964) · 1964
Earlier work this paper cites.
Three approaches to the quantitative definition of information
Kolmogorov, A. (1965) · 1965
Earlier work this paper cites.
On the length of programs for computing finite binary sequences
Chaitin, G. (1966) · 1966
Earlier work this paper cites.
On the symmetry of algorithmic information
Gács, P. (1974) · 1974
Earlier work this paper cites.
Talk at the Information Theory Symposium in Tallinn, Estonia, 1974
Kolmogorov, A. (1974a) · 1974
Earlier work this paper cites.
Complexity of algorithms and objective definition of randomness
Kolmogorov, A. (1974b) · 1974
Earlier work this paper cites.
A theory of program size formally identical to information theory
Chaitin, G. (1975) · 1975
Earlier work this paper cites.
Modeling by the shortest data description
Rissanen, J. (1978) · 1978
Earlier work this paper cites.
Logically Smooth Density Estimation
Barron, A. R. (1985) · 1985
Earlier work this paper cites.
Algorithmic Information Theory
Chaitin, G. (1987) · 1987
Cited alongside, same era.
Stochastic Complexity in Statistical Inquiry
Rissanen, J. (1989) · 1989
Cited alongside, same era.
Minimum complexity density estimation
Barron, A. and T. Cover (1991) · 1991
Cited alongside, same era.
Elements of Information Theory
Cover, T. and J. Thomas (1991) · 1991
Cited alongside, same era.
Fisher information and stochastic complexity
Rissanen, J. (1996) · 1996
Cited alongside, same era.
An Introduction to Kolmogorov Complexity and Its Applications
Li, M. and P. Vitányi (1997) · 1997
Cited alongside, same era.
Algorithmic statistics
Gács, P., J. Tromp, and P. Vitányi (2001) · 2001
Shannon information and Kolmogorov complexity,
Grünwald, P. D. and P. M. Vitányi (2004) · 2004
Later among the works it cites.
Kolmogorov’s structure functions and model selection
Vereshchagin, N. and P. Vitányi (2004) · 2004
Later among the works it cites.
Clustering by compression
Cilibrasi, R. and P. Vitányi (2005) · 2005
Later among the works it cites.
Kolmogorov’s structure function in MDL theory and lossy data compression
Rissanen, J. and I. Tabus (2005) · 2005
Later among the works it cites.
Algorithmic statistics and Kolmogorov’s structure function
Vitányi, P. M. (2005) · 2005
Later among the works it cites.
Statistical and Inductive Inference by Minimum Message Length
Wallace, C. (2005) · 2005
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Kolmogorov complexity and information theory; with an interpretation in terms of questions and answers
Grünwald, P. and P. Vitányi (2003) · 2003
Cited alongside, same era.
Prediction is coding
Grünwald, P. D. (2007) · 2007
Later among the works it cites.
The quantitative theory of information
Harremoës, P. and F. Topsøe (2007) · 2007
Later among the works it cites.