Abstract
The definition of computation models is central to algorithmic research. A model is designed to capture the essential features of the technology considered, dispensing with irrelevant and burdensome details. In other words, it is a judicious compromise between simplicity, for the ease of analysis, and fidelity (or reflectivity), for the value of the derived predictions. The achievement of this double objective has unleashed an enormous amount of valuable algorithmic research over the years.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Preparata, F.P. (2006). The Unpredictable Deviousness of Models. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_1
Download citation
DOI: https://doi.org/10.1007/11809678_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)