[baxtr]

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]

The complex objects are conceptually similar to prime numbers.