The Kolmogorov complexity K(s) is the length of the shortest program that produces string s.
Random strings have high complexity (incompressible). Patterned strings have low complexity (simple description).
Note: True K(s) is uncomputable, but we can approximate it using compression.