Kolmogorov complexity

The Kolmogorov complexity of an object (such as a text string) is the length of the shortest program that produces the object.

If the size of this program exeeds the size of the object, the object is said to be uncompressible.