The Computer Journal · 1999 · 358 citations · 16 references
ComputingComputer ScienceMathematicsAlgorithmsMachine LearningProbability TheoryAlgorithmic ComplexityComplexity TheoryComputational ComplexityTuring MachinesComplexityComplexity Of String AlgorithmsKolmogorov ComplexityKolmogorov TheoryMessage LengthTuring Machine CharacterizationsTuring Machine ComplexityTuring Machine Model
this paper is to describe some of the relationships among the different streams and to try to clarify some of the important differences in their assumptions and development. Other studies mentioning the relationships appear in [1, Section IV, pp. 1038--1039], [2, sections 5.2, 5.5] and [3, p. 465]
16
Modeling by shortest data description
J. Rissanen · Automatica · 1978 · 6K citations
A formal theory of inductive inference. Part II
Ray J. Solomonoff · Information and Control · 1964 · 1.8K citations
An Information Measure for Classification
Christopher S. Wallace, D. M. Boulton · The Computer Journal · 1968 · 947 citations · Full text
On the Length of Programs for Computing Finite Binary Sequences
Gregory J. Chaitin · Journal of the ACM · 1969 · 917 citations · Full text