Probability Models and The Kolmogorov Structure Function
For every computable probability distribution P it can be proved that . For example, if P is the uniform distribution on the set S of strings of length n, then each has probability . In the general case of computable probability mass functions we incur a logarithmic additive error term. Kolmogorov's structure function becomes
where x is a binary string of length n with where P is a contemplated model (computable probability of n-length strings) for x, is the Kolmogorov complexity of P and is an integer value bounding the complexity of the contemplated P's. Clearly, this function is nonincreasing and reaches for where c is the required number of bits to change x into and is the Kolmogorov complexity of x. Then . For every complexity level the function is the Kolmogorov complexity version of the maximum likelihood (ML).
Read more about this topic: Kolmogorov Structure Function
Famous quotes containing the words probability, models, structure and/or function:
“Only in Britain could it be thought a defect to be “too clever by half.” The probability is that too many people are too stupid by three-quarters.”
—John Major (b. 1943)
“French rhetorical models are too narrow for the English tradition. Most pernicious of French imports is the notion that there is no person behind a text. Is there anything more affected, aggressive, and relentlessly concrete than a Parisan intellectual behind his/her turgid text? The Parisian is a provincial when he pretends to speak for the universe.”
—Camille Paglia (b. 1947)
“A special feature of the structure of our book is the monstrous but perfectly organic part that eavesdropping plays in it.”
—Vladimir Nabokov (1899–1977)
“My function in life is not to be a politician in Parliament: it is to get something done.”
—Bernadette Devlin (b. 1947)