Skip to main content

Enrichment Topic: “Efficient” Pairing Functions, with Applications

  • Chapter
  • First Online:
The Pillars of Computation Theory

Part of the book series: Universitext ((UTX))

  • 1595 Accesses

Abstract

We have already seen the preceding admonition by William of Occam (fourteenthth century), in Section 6.1.2. The principle that underlies the admonition—always to strive for simplicity—is particularly worth heeding when one seeks mathematical models of computational phenomena, for it is always tempting to embellish one’s models with “real” features of the phenomenon or structure being modeled.

Entia non sunt multiplicanda praeter necessitatem.

Occam’s razor, William of Occam)

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arnold L. Rosenberg .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag New York

About this chapter

Cite this chapter

Rosenberg, A.L. (2010). Enrichment Topic: “Efficient” Pairing Functions, with Applications. In: The Pillars of Computation Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09639-1_8

Download citation

Publish with us

Policies and ethics