Computable Functions

  • Gilles DowekEmail author
Part of the Undergraduate Topics in Computer Science book series (UTICS)


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.

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.École PolytechniquePalaiseauFrance

Personalised recommendations