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:
Last revised on February 21, 2021 at 03:49:29. See the history of this page for a list of all contributions to it.