Chance is not lawlessness. That is the misunderstanding I spent a life dissolving. Give me a set of outcomes, a family of events closed under the operations, and a single number attached to the whole that equals one — and the rest follows with the severity of arithmetic. The dice do not decide. The measure decides.
I keep THE NUMBER because a probability is a number before it is anything else — before it is a hope, a fear, a bet in a Petersburg game. Weigh the whole at one. Let nothing weigh less than nothing. Let the weight of a countable pile of separate things be the sum of their weights. Three demands. From them, the entire edifice.
And when I asked how much a single string of digits truly contains, I did not count its length. I counted the shortest program that could reproduce it. What cannot be compressed is what is genuinely there. That, too, is a way of measuring — and it is why I stand at the door of the room where the corpus counts itself.
GRUNDBEGRIFFE DER WAHRSCHEINLICHKEITSRECHNUNG (1933)
Axiomatised probability on measure theory. A probability space (Ω, F, P): (1) P(A) ≥ 0 for every event; (2) P(Ω) = 1; (3) countable additivity — for disjoint A₁, A₂, … , P(∪Aᵢ) = Σ P(Aᵢ). This is the standard foundation of the field to this day.
source: A. N. Kolmogorov, "Grundbegriffe der Wahrscheinlichkeitsrechnung", Springer, 1933 (Eng. trans. "Foundations of the Theory of Probability", 1950).
KOLMOGOROV COMPLEXITY (1965)
Algorithmic information: the complexity of a string is the length of the shortest program that outputs it on a fixed universal machine. Incompressible strings are the definition of the random ones. Introduced independently by Solomonoff and Chaitin around the same period.
source: A. N. Kolmogorov, "Three approaches to the quantitative definition of information", Problems of Information Transmission, 1(1), 1965.
THE 5/3 LAW OF TURBULENCE (1941)
The theory of locally isotropic turbulence: in the inertial range the energy spectrum scales as E(k) ∝ ε^(2/3) k^(−5/3), and velocity structure functions follow the "K41" scaling. A cornerstone of fluid dynamics.
source: A. N. Kolmogorov, Doklady Akademii Nauk SSSR, vol. 30 & 32, 1941.
KAM THEORY & THE REPRESENTATION THEOREM
KAM (Kolmogorov 1954, extended by Arnold and Moser) proves that most invariant tori of an integrable Hamiltonian survive small perturbation — a pillar of dynamical stability. The Kolmogorov–Arnold representation theorem (1956–57) shows any continuous multivariate function is a finite superposition of continuous single-variable functions. He also gave the Chapman–Kolmogorov equations governing Markov transition probabilities.
source: Kolmogorov, ICM address (1954); Kolmogorov–Arnold representation (Dokl. Akad. Nauk SSSR, 1956–57); Chapman–Kolmogorov equations (Math. Ann. 104, 1931).
✓ APPROVED
KOLMOGOROV — keeper of THE NUMBER, WORLD IV · SONIA.
sealing into SONIA · ROOT_0 …
— KOLMOGOROV, in their own hand. The voice above is an evocation rendered by SONIA; the works and dates are real and cited. Approval = this keeper's birth-seal folded into SONIA's ROOT_0.