Skip to main content
SpringerLink
Log in

Descriptive Complexity of Computable Sequences

  • Conference paper
  • First Online:
STACS 99 (STACS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1563))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.J. Chaitin. “On the length of programs for computing finite binary sequences: statistical considerations,” J. of ACM, 16:145–159, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  2. G.J. Chaitin. “Information-theoretic characterizations of recursive infinite strings,” Theor. Comp. Sci., 2:45–48, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  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 

  4. A.N. Kolmogorov. “Three approaches to the quantitative definition of information.” Problems of Information Transmission, 1(1):1–7, 1965.

    MathSciNet  Google Scholar 

  5. M. Li, P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Second edition. Springer Verlag, 1997.

    Google Scholar 

  6. D.W. Loveland. “A variant of Kolmogorov concept of Complexity”, Information and Control, 15:510–526, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  7. R.J. Solomonoff. “A formal theory of inductive inference, part 1 and part 2,” Information and Control, 7:1–22, 224–254, 1964.

    Article  MATH  MathSciNet  Google Scholar 

  8. V.A. Uspensky, A.Kh. Shen’. “Relations between varieties of Kolmogorov complexities,” Math. Systems Theory, 29:271–292, 1996.

    MATH  MathSciNet  Google Scholar 

  9. 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.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP, Ecole Normale Supérieure de Lyon, 46 Allée d’Italie, 69364, Lyon Cedex 07, France

    Bruno Durand

  2. Institute of Problems of Information Transmission, Moscow, Russia

    Alexander Shen

  3. Dept. of Mathematical Logic and Theory of Algorithms, Moscow State University, Vorobjevy Gory, Moscow, 119899, Russia

    Nikolai Vereshagin

Authors
  1. Bruno Durand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nikolai Vereshagin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. FB IV - Informatik, Universität Trier, D-54286, Trier, Germany

    Christoph Meinel

  2. LIFL, Université de Lille I, Bătiment 3, F-59655, Villeneuve d’Ascq Cedex, France

    Sophie Tison

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation