Skip to main content

Algorithmic Information

  • Chapter
  • 486 Accesses

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 684))

Abstract

Intuitively, information and complexity go together. We feel that a complex message must contain more information then a simple one. Complexity is, however, an illusive property. A Mandelbrot fractal pattern may look intricate, indeed, but to a mathematician it is simple. No more information than a small piece of computer program is needed to reproduce the pattern.

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   59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   54.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Reference

  1. In this form not a paradox, “all that follows is that Epimenides is a liar and that at least one Cretan is truthful” Smullyan, 1990, p.226. The real paradox is that an islander lies. I can assure that all islanders (mostly fishermen and sailors) are always truthful, because I am myself from the Åland Islands.

    Google Scholar 

  2. G.J. Chaitin: “A theory of program size formally identical to information theory”, J.ACM 22 (1975), pp. 329..340.

    Article  MathSciNet  MATH  Google Scholar 

  3. Our private psychological probabilities may induce us to predict the unpredictable, as manifested in “the Monte Carlo fallacy, which makes us expect a failure after a run of successes, and vice versa” Cohen, 1954, p.34.

    Google Scholar 

  4. A. Pickering: Constructing Quarks/Edinburgh Univ. Press, 1984. Related in Gribbin, 1996, p. 198.

    Google Scholar 

  5. Based on the hypothesis that every culture by necessity goes through a cycle of spring-summer-fall-winter Spengler, 1923, p.68.

    Google Scholar 

  6. Identical as a problem to Bertrand’s box paradox Blackburn, 1996, p.44.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kåhre, J. (2002). Algorithmic Information. In: The Mathematical Theory of Information. The Springer International Series in Engineering and Computer Science, vol 684. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0975-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0975-2_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5332-4

  • Online ISBN: 978-1-4615-0975-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics