1.Previous
3.Next

defines a random string as one that cannot be produced from any computer program that is shorter than the string (Chaitin-Kolmogorov randomness); i.e. a string whose Kolmogorov complexity is at least the length of the string. This is a different meaning from the usage of the term in statistics. Whereas statistical randomness refers to the process that produces the string (e.g. flipping a coin to produce each bit will randomly produce a string),

1.Previous
3.Next