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:
“There’s one basic rule you should remember about development charts that will save you countless hours of worry.... The fact that a child passes through a particular developmental stage is always more important than the age of that child when he or she does it. In the long run, it really doesn’t matter whether you learn to walk at ten months or fifteen months—as long as you learn how to walk.”
—Lawrence Kutner (20th century)
“The restlessness that comes upon girls upon summer evenings results in lasting trouble unless it is speedily controlled. The right kind of man does not look for a wife on the streets, and the right kind of girl waits till the man comes to her home for her.”
—Sedalia Times (1900)