Skip to main content

Computability and Complexity

  • Chapter
Classical and Quantum Computing
  • 1043 Accesses

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.

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

Rights and permissions

Reprints 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

Publish with us

Policies and ethics