Kolmogorov complexity

**constructive mathematics**, **realizability**, **computability**

propositions as types, proofs as programs, computational trinitarianism

The *Kolmogorov complexity* of a piece of data is a measure for the computability resources needed to specify it. This is a central concept in complexity theory.

Named after Andrey Kolmogorov.

See also:

- Wikipedia,
*Kolmogorov complexity*

Last revised on February 20, 2021 at 22:49:29. See the history of this page for a list of all contributions to it.