Russian Mathematical Surveys · 1983 · 318 citations · 6 references
Natural SciencesMathematicsInformation TheoryProbability TheoryStatisticsInformation MeasuresLimit TheoremsMarkov ChainsMarkov ProcessesProbabilistic CombinatoricsComplexityInfinite SequencesInfinite Series Of Random VariablesMeasure-theoretic EntropyProbabilistic Complexity Classes
CONTENTS § 1. The growing role of finite mathematics § 2. Information theory § 3. The definition of "complexity" § 4. Regularity and randomness § 5. The stability of frequencies § 6. Infinite random sequences § 7. Relative complexity and quantity of information § 8. Barzdin's theorem § 9. Conclusion References
6
A formal theory of inductive inference. Part II
Ray J. Solomonoff · Information and Control · 1964 · 1.8K citations
On the Length of Programs for Computing Finite Binary Sequences
Gregory J. Chaitin · Journal of the ACM · 1969 · 917 citations · Full text
On the concept of a random sequence
Alonzo Church · Bulletin of the American Mathematical Society · 1940 · 398 citations · Full text