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)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights 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
DOI: https://doi.org/10.1007/978-0-387-09639-1_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-56117-2
Online ISBN: 978-0-387-09639-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)