Kolmogorov complexity + MDL

Layer 0 — Mathematicsin the information-theory subtree

Kolmogorov 1965 / Solomonoff / Chaitin: K(x) = length of shortest program outputting x on universal machine. Algorithmic randomness. MDL Rissanen 1978 model-selection. Bridges info-theory + computer-science.

Related concepts

Explore Kolmogorov complexity + MDL on the interactive knowledge graph →