Kolmogorov Complexity

A central concept in algorithmic information theory that defines the complexity of a data string as the length of the shortest program capable of producing that string. It serves as the theoretical foundation for measuring the intrinsic complexity of information and the limits of compression.