Life is very compressible
An information representation (or string) s is very compressible if the size of it's smallest possible compression K(s) is very small compared with it's observed size(s) . The smallest compression size K(s) is the Kolmogorov complexity . We can define the compress-ibility C(s) of a string s to be the smallest compression K(s) divided by the size of the original representation size(s) : C(s) = K(s) / Size(s) - lower is better The smallest compressed size" for any given string is a function that cannot be calculated in general, however you can always find an upper bound to it as soon as you find a compression of that size. A compression of s is basically a program along with it's input that can generate s as output. If is always possible to find a program slightly bigger than s (think: print " s "), therefore it is only interesting to find compression with size that is lower than size( s ).