Abstract
Once we have the building blocks for a computing device, we can construct the device and give it tasks to perform. Some tasks are more difficult than others. Some tasks may even be impossible for the computing device to perform. This is the concept of computability. Since tasks can be represented as functions, we need to determine the computability of functions. The computable functions are obviously limited by the computing device, but if we choose a sufficiently general computing device it can serve as a measure for computability.
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
Rights and permissions
Copyright information
© 2001 Springer Basel AG
About this chapter
Cite this chapter
Hardy, Y., Steeb, WH. (2001). Computability and Complexity. In: Classical and Quantum Computing. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8366-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8366-5_13
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-6610-0
Online ISBN: 978-3-0348-8366-5
eBook Packages: Springer Book Archive