Kolmogorov complexity — The Probability Path
Node
Kolmogorov complexity (Theorem) in The Probability Path. Era: 1965. Formula: K(x) = min{|p| : U(p) = x}. Origin axiom of path: Kolmogorov's axioms of probability. Modern reach: Kolmogorov complexity · Algorithmic information theory.