From https://en.wikipedia.org/wiki/Kolmogorov_complexity#Kolmogorov_randomness https://en.wikipedia.org/wiki/Kolmogorov_complexity#Kolmogor... : Kolmogorov ran

From https://en.wikipedia.org/wiki/Kolmogorov_complexity#Kolmogorov_randomness https://en.wikipedia.org/wiki/Kolmogorov_complexity#Kolmogor... : Kolmogorov 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. To make this precise, a universal computer (or universal Turing machine) must be specified, so that "program" means a program for this universal machine. A random string in this sense is "incompressible" in that it is impossible to "compress" the string into a program whose length is shorter than the length of the string itself. A counting argument is used to show that, for any universal computer, there is at least one algorithmically random string of each length. Whether any particular string is random, however, depends on the specific universal computer that is chosen.