measures the length of the shortest program required to reproduce a pattern.
The Compress function in Mathematica is another, more traditional way to approximate Kolmogorov complexity, and is shown for comparison, but unlike the coding theorem, lossless compression techniques do not deal well with small patterns.
Invariance with respect to linear or affine transformations