Suppose we want to describe a given object by a finite binary string. We do not care whether the object has many descriptions; however, each description should describe but one object. Prom among all descriptions of an object we can take the length of the shortest description as a measure of the object’s complexity. It is natural to call an object ‘simple’ if it has at least one short description, and to call it ‘complex’ if all of its descriptions are long.
KeywordsTuring Machine Binary String Recursive Function Code Word Kolmogorov Complexity
Unable to display preview. Download preview PDF.