Skip to main content

Robustness of Logical Depth

  • Conference paper
  • 1698 Accesses

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

Abstract

Usually one can quantify the subjective notion of useful information in two different perspectives: static resources – measuring the amount of planing required to construct the object; or dynamic resources – measuring the computational effort required to produce the object. We study the robustness of logical depth measuring dynamic resources, proving that small variations in the significance level can cause large changes in the logical depth.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adriaans, P.: Facticity as the amount of self-descriptive information in a data set (2012)

    Google Scholar 

  2. Antunes, L., Fortnow, L.: Sophistication revisited. Theory of Computing Systems 45(1), 150–161 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Antunes, L., Fortnow, L., van Melkebeek, D., Vinodchandran, N.: Computational depth: concept and applications. Theoretical Computer Science 354(3), 391–404 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bennett, C.: Logical depth and physical complexity. In: A half-Century Survey on the Universal Turing Machine, pp. 227–257. Oxford University Press, Inc., New York (1988)

    Google Scholar 

  5. Chaitin, G.: On the length of programs for computing finite binary sequences. Journal of ACM 13(4), 547–569 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gell-Mann, M., Lloyd, S.: Information measures, effective complexity, and total information. Complexity 2(1), 44–52 (1996)

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  8. Koppel, M.: Complexity, depth, and sophistication. Complex Systems 1, 1087–1091 (1987)

    MathSciNet  MATH  Google Scholar 

  9. Koppel, M.: Structure. The Universal Turing Machine: A Half-Century Survey, 2nd edn., pp. 403–419. Springer (1995)

    Google Scholar 

  10. Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer (2008)

    Google Scholar 

  11. Solomonoff, R.: A formal theory of inductive inference, Part I. Information and Control 7(1), 1–22 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  12. Vitányi, P.M.B.: Meaningful information. IEEE Transactions on Information Theory 52(10), 4617–4626 (2006)

    Article  Google Scholar 

  13. Wolpert, D.H., Macready, W.: Using self-dissimilarity to quantify complexity. Complexity 12(3), 77–85 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Antunes, L., Souto, A., Teixeira, A. (2012). Robustness of Logical Depth. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30870-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30869-7

  • Online ISBN: 978-3-642-30870-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics