Source: wikibot/kolmogorov-complexity

= Kolmogorov complexity
{wiki=Kolmogorov_complexity}

Kolmogorov complexity, named after the Russian mathematician Andrey Kolmogorov, is a concept in algorithmic information theory that quantifies the complexity of a string or object in terms of the length of the shortest possible description or program that can generate that string using a fixed computational model (usually a Turing machine).