information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest...

kinds of Kolmogorov complexity are studied: the uniform complexity, prefix complexity, monotone complexity, time-bounded Kolmogorov complexity, and space-bounded...

mechanics, algorithmic information theory and computational complexity. Andrey Kolmogorov was born in Tambov, about 500 kilometers south-southeast of...

that the Kolmogorov complexity is not computable. The proof by contradiction shows that if it were possible to compute the Kolmogorov complexity, then it...

machine used to define Kolmogorov complexity, but any choice gives identical asymptotic results because the Kolmogorov complexity of a string is invariant...

area. The field of Kolmogorov complexity and algorithmic randomness was developed during the 1960s and 1970s by Chaitin, Kolmogorov, Levin, Martin-Löf...

"Minimum Message Length and Kolmogorov Complexity." Nannen, Volker. "A short introduction to Model Selection, Kolmogorov Complexity and Minimum Description...

The chain rule[citation needed] for Kolmogorov complexity is an analogue of the chain rule for information entropy, which states: H ( X , Y ) = H ( X...

maximal Kolmogorov complexity. The Kolmogorov structure function of an individual data string expresses the relation between the complexity level constraint...

extended Turing test. or by tests which are completely derived from Kolmogorov complexity. Other related tests in this line are presented by Hernandez-Orallo...