Kolmogorov Complexity
A foundational concept in computational theory that defines the complexity of a data object as the length of the shortest computer program capable of generating it. It provides a theoretical lower bound on information content and randomness, and is closely related to information theory and data compression.
Timeline (last 90 days)
The entropy of information (the lower bound for lossless representation) and the amount of computation required to generate that information are two different concepts with no necessary equivalence.
Images of the Mandelbrot set are visually rich in detail (very high Shannon entropy), yet the rules for generating them are extremely concise (very low Kolmogorov complexity).
All Facts (2)
The entropy of information (the lower bound for lossless representation) and the amount of computation required to generate that information are two different concepts with no necessary equivalence.
50%UnverifiedImages of the Mandelbrot set are visually rich in detail (very high Shannon entropy), yet the rules for generating them are extremely concise (very low Kolmogorov complexity).
50%