An infinite binary sequence is said to be random if, for some constant c, for all n, the Kolmogorov complexity of the initial segment of length n of the sequence is at least n − c.
(Related definitions can be made for alphabets other than the set \{0,1\}.) .