Defines an object’s complexity as the length of the shortest computer program (in bits) that can produce it as output.
It measures the ultimate limit of data compression: structured data has low complexity, while random, incompressible data has high complexity.
Examples: A long sequence of “01” repeated 1,000 times has low complexity because a short program (print "01" * 1000) can generate it. Conversely, a truly random string cannot be described by a short program and must be represented as is.