This measurement is applied by the Minimum Description Length principle in statistical model selection, whereby the members of a class of models are each simulated by a universal model. This quantity can be computationally defined as the length of the shortest Turing machine program that accurately (*) reproduces the data being measured, and when this measurement for a string is close to the upper bound of the log of the size of the alphabet, the string is said to be random. For 10 points, identify this measurement in the theory of information defined as the minimum amount of bits it takes to 
This measurement is applied by the Minimum Description Length principle in statistical model selection, whereby the members of a class of models are each simulated by a universal model. This quantity can be computationally defined as the length of the shortest Turing machine program that accurately (*) reproduces the data being measured, and when this measurement for a string is close to the upper bound of the log of the size of the alphabet, the string is said to be random. For 10 points, identify this measurement in the theory of information defined as the minimum amount of bits it takes to represent a longer string without losing information, named after a Russian mathematician and computer scientist who, with Smirnov, names a test for determining whether a sample fits a given distribution.
This measurement is applied by the Minimum Description Length principle in statistical model selection, whereby the members of a class of models are each simulated by a universal model.
{Kolmogorov} complexity [Accept {algorithmic complexity}] (6) [ES]