 In 1966 Per Martin-Löf introduced a new notion which is now generally considered the most satisfactory notion of algorithmic randomness.His original definition involved measure theory, but it was later shown that it can be expressed in terms of Kolmogorov complexity.Kolmogorov's definition of a random string was that it is random if has no description shorter than itself via a universal Turing machine.