Abstract
This chapter introduces a first approach to algorithmic method by introducing the notion of a computable function that abstracts the notion of an algorithm. It discusses computability over natural numbers, lists, and trees and culminates with the first negative computability result: the undecidability of the halting problem.
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
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Dowek, G. (2011). Computable Functions. In: Proofs and Algorithms. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-121-9_3
Download citation
DOI: https://doi.org/10.1007/978-0-85729-121-9_3
Publisher Name: Springer, London
Print ISBN: 978-0-85729-120-2
Online ISBN: 978-0-85729-121-9
eBook Packages: Computer ScienceComputer Science (R0)