Abstract
Computational artifacts must perform their function. Part of this involves constraints upon their practicality: programs should involve computations that can be carried out in a reasonable time using reasonable resources. But what is reasonable? Presumably, a program that on average takes more than the age of the universe to return its results is not reasonable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
Turner, R. (2018). Feasible Computations. In: Computational Artifacts. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55565-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-662-55565-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-55564-4
Online ISBN: 978-3-662-55565-1
eBook Packages: Computer ScienceComputer Science (R0)