Skip to main content

The Natural Numbers as a Universal Library

  • Chapter
  • First Online:
Philosophy of Mathematics Today

Part of the book series: Episteme ((EPIS,volume 22))

Abstract

We would like to be able to measure the complexity (or quantity, or form, or structure) of any finite symbolic objects, such as chromosomes, texts, pictures and pieces of music. How much form does such an object have, how complex is it? We would like our measure to be uniform, so as to allow us to compare the complexity of heterogeneous objects, like genes, photos and songs.

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

Access this chapter

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 EPUB and 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
Hardcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Boolos, G. and Jeffrey, R. [1980] Computability and Logic, (2nd ed.), Cambridge: Cambridge University Press.

    MATH  Google Scholar 

  • Gödel, K. [1931] Über formal unentscheidbare Sätze der Principia Mathanatica und verwandter Systeme I, Monatshefte für Mathematik und Physik, 38, 173–198.

    Article  MathSciNet  Google Scholar 

  • Hermes, H. [1971] Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit, (2nd ed.), Berlin/New York: Springer-Verlag.

    Book  Google Scholar 

  • Kolmogorov, A. [1968] Logical basis for information theory and probability theory, IEEE Transactions on Information Theory, vol. IT-14, 662–664.

    Article  MathSciNet  Google Scholar 

  • Lebow, I. [1991] The Digital Connection, New York: Computer Science Press.

    Google Scholar 

  • Luther, A. [1989] Digital Video in the PC Environment, New York: McGraw Hill.

    Google Scholar 

  • Ming L. and Vitanyi, P. [1990] Kolmogorov complexity and its applications, in: J. van Leeuwen, (ed.), Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, Amsterdam: Elsevier.

    Google Scholar 

  • Mosterín, J. [1992] Scientific theories and the flow of information, in: Echeverría, I. and Mormann, (eds.), The Space of Mathematics. Philosophical, Epistemological and Historical Explorations, Berlin-New York: De Gruyter, pp. 366–378.

    Google Scholar 

  • Poundstone, W. [1985] The Recursive Universe, New York: William Morrow.

    MATH  Google Scholar 

  • Rucker, R. [1987] Mind Tools: The Mathematics of Information, London: Penguin Books.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Mosterín, J. (1997). The Natural Numbers as a Universal Library. In: Agazzi, E., Darvas, G. (eds) Philosophy of Mathematics Today. Episteme, vol 22. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5690-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-5690-5_18

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6400-2

  • Online ISBN: 978-94-011-5690-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics