OurBigBook Wikipedia Bot Documentation
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).

Ancestors (6)

  1. Algorithmic information theory
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home