Descriptive complexity of computable sequences

Authors:
Bruno Durand;Alexander Shen;Nikolai Vereshagin
Affiliations:
LIP, Lyon Cedex 07, France;Institute of Problems of Information Transmission, Moscow, Russia;Dept. of Mathematical Logic and Theory of Algorithms, Moscow State University, Moscow, Russia
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 3
Cited 3

An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations

Journal of the ACM (JACM)
Comparison Between the Complexity of a Function and the Complexity of Its Graph

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science

Descriptive complexity of computable sequences

Theoretical Computer Science
Kolmogorov complexity conditional to large integers

Theoretical Computer Science
Information distance and conditional complexities

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.