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.
The work was done while visiting LIP, Ecole Normale Supérieure of Lyon.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G.J. Chaitin. “On the length of programs for computing finite binary sequences: statistical considerations,” J. of ACM, 16:145–159, 1969.
G.J. Chaitin. “Information-theoretic characterizations of recursive infinite strings,” Theor. Comp. Sci., 2:45–48, 1976.
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.
A.N. Kolmogorov. “Three approaches to the quantitative definition of information.” Problems of Information Transmission, 1(1):1–7, 1965.
M. Li, P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Second edition. Springer Verlag, 1997.
D.W. Loveland. “A variant of Kolmogorov concept of Complexity”, Information and Control, 15:510–526, 1969.
R.J. Solomonoff. “A formal theory of inductive inference, part 1 and part 2,” Information and Control, 7:1–22, 224–254, 1964.
V.A. Uspensky, A.Kh. Shen’. “Relations between varieties of Kolmogorov complexities,” Math. Systems Theory, 29:271–292, 1996.
A.K. Zvonkin, L.A. Levin. “The complexity of finite objects and the development of the concepts of information and randomness by means of theory of algorithms.” Russian Math. Surveys, 25(6):83–124, 1970.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Durand, B., Shen, A., Vereshagin, N. (1999). Descriptive Complexity of Computable Sequences. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_14
Download citation
DOI: https://doi.org/10.1007/3-540-49116-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65691-3
Online ISBN: 978-3-540-49116-3
eBook Packages: Springer Book Archive