Nothing up my sleeve number

Chaitin-Kolmogorov randomness (also called algorithmic randomness) defines a string (usually of bits) as being random if and only if it is shorter than any computer program that can produce that string. It is fairly easy to see that most strings of a given length are close to random in this sense. Chaitin-Kolmogorov randomness distinguishes, at least in principle, between numbers that are generated by pseudo-random number generators and true random numbers. However pseudo-random number generators and true random numbers ...

Read more here: » Chaitin–Kolmogorov randomness: Encyclopedia - Chaitin–Kolmogorov randomness