The ultimate limit of data compression
Kolmogorov complexity defines the shortest possible description for any data, revealing the absolute limits of compression and why truly random information cannot be shrunk.
Imagine the shortest computer program that can create a piece of data; that's Kolmogorov complexity. Introduced in 1965, it sets the absolute minimum for data compression, as nothing can be shorter without losing information. A simple string like '1111111111' has low complexity because a tiny program can generate it, compressing it dramatically. But a truly random string, like '7k9p2m4q8r', needs a program almost as long as itself, meaning it's incompressible. This concept reveals why everyday compression tools can only approximate this theoretical limit, highlighting the inherent patterns in most data we use. It also ensures encrypted messages appear random, making them secure.