Skip to main content
SpringerLink
Log in

Prefix-Free and Prefix-Correct Complexities with Compound Conditions

  • Conference paper
Computer Science – Theory and Applications (CSR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6072))

Included in the following conference series:

  • 688 Accesses

Abstract

In this paper we compare two types of conditional prefix complexity assuming that conditions are sets of strings rather than [4] strings. We show that prefix-free and prefix-correct versions of the definition are essentially different.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Chaitin, G.J.: A theory of program size formally identical to information theory. Journal of the ACM 22, 329–340 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  2. Gács, P.: On the symmetry of algorithmic information. Soviet Math. Dokl. 15(5) (1974)

    Google Scholar 

  3. Levin, L.A.: Laws of information conservation (non-growth) and aspects of the foundation of probability theory. Problems of Information Transmission 10, 206–210 (1974)

    Google Scholar 

  4. Levin, L.A.: The various measures of the complexity of finite objects (an axiomatic description). Soviet Math. Dokl. 17, 522–526 (1976)

    MATH  Google Scholar 

  5. Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn., p. 638. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  6. Shen, A., Vereshchagin, N.K.: Logical operations and Kolmogorov complexity. Theoretical Computer Science 271, 125–129 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Uspensky, V.A., Vereshchagin, N.K., Shen, A.: Kolmogorov complexity (a textbook in preparation)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanics and Mathematics, Moscow State University, Russia

    Elena Kalinina

Authors
  1. Elena Kalinina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Theoretical Cybernetics, Kazan State University, 420008, Kazan, Russia

    Farid Ablayev

  2. Institut für Informatik, Technische Universität München, 85748, Garching, Germany

    Ernst W. Mayr

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalinina, E. (2010). Prefix-Free and Prefix-Correct Complexities with Compound Conditions. In: Ablayev, F., Mayr, E.W. (eds) Computer Science – Theory and Applications. CSR 2010. Lecture Notes in Computer Science, vol 6072. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13182-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13182-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13181-3

  • Online ISBN: 978-3-642-13182-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation