Basic Results
In the following discussion, let K(s) be the complexity of the string s.
It is not hard to see that the minimal description of a string cannot be too much larger than the string itself - the program GenerateFixedString above that outputs s is a fixed amount larger than s.
Theorem: There is a constant c such that
Read more about this topic: Kolmogorov Complexity
Famous quotes containing the words basic and/or results:
“The man who is admired for the ingenuity of his larceny is almost always rediscovering some earlier form of fraud. The basic forms are all known, have all been practicised. The manners of capitalism improve. The morals may not.”
—John Kenneth Galbraith (b. 1908)
“The study and knowledge of the universe would somehow be lame and defective were no practical results to follow.”
—Marcus Tullius Cicero (106–43 B.C.)