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:
“Surrealism is not a school of poetry but a movement of liberation.... A way of rediscovering the language of innocence, a renewal of the primordial pact, poetry is the basic text, the foundation of the human order. Surrealism is revolutionary because it is a return to the beginning of all beginnings.”
—Octavio Paz (b. 1914)
“Different persons growing up in the same language are like different bushes trimmed and trained to take the shape of identical elephants. The anatomical details of twigs and branches will fulfill the elephantine form differently from bush to bush, but the overall outward results are alike.”
—Willard Van Orman Quine (b. 1908)