Kolmogorov complexity
Theorem: There exist strings of arbitrarily large Kolmogorov complexity. Formally: for each "n" ∈ ℕ, there is a string "s" with "K"("s") ≥ "n".