Order – Structure vs randomness videos
Complexity. Kolmogorov complexity gives a notion of randomness (a string being random if its Kolmogorov complexity is about as large as its length). Martin-Lof (Mar 66) developed a definition of randomness somewhat different from Kolmogorov's, using "randomness tests". Paper
Almost all images are indistinguishable from random noise, and almost all data sets and functions are in-distinguishable from completely random ones. This fol-lows from Borel's theorem on normal numbers (Les probabilités dénombrables et leurs applications arithmétiques), which states that almost all real numbers have a string of decimals that would pass any randomness test,i.e., are indistinguishable from random noise.