Descriptive Complexity of Computable Sequences
Our goal is to study the complexity of infinite binary recursive sequences. We introduce several measures of the quantity of information they contain. Some measures are based on size of programs that generate the sequence, the others are based on the Kolmogorov complexity of its finite prefixes. The relations between these complexity measures are established. The most surprising among them are obtained using a specific two-players game.
KeywordsComplexity Measure Binary String Computable Function Special Node Kolmogorov Complexity
Unable to display preview. Download preview PDF.
- 3.B. Durand, S. Porrot. Comparison between the complexity of a function and the complexity of its graph. In MFCS’98. Lecture Notes in Computer Science, 1998.Google Scholar
- 5.M. Li, P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Second edition. Springer Verlag, 1997.Google Scholar