3 ms·
Kolmogorov complexity is the length of the shortest computer program that can produce a specific object as output. It formalizes the idea that simple objects ha
by baxtr 1y ago
Kolmogorov complexity is the length of the shortest computer program that can produce a specific object as output. It formalizes the idea that simple objects have short descriptions, while complex (random) objects are incompressible.
- dorgo 1y agoThe complex objects are conceptually similar to prime numbers.