Book contents
- Frontmatter
- Contents
- Preface
- COMPUTABILITY THEORY
- 1 Enumerability
- 2 Diagonalization
- 3 Turing Computability
- 4 Uncomputability
- 5 Abacus Computability
- 6 Recursive Functions
- 7 Recursive Sets and Relations
- 8 Equivalent Definitions of Computability
- BASIC METALOGIC
- FURTHER TOPICS
- Hints for Selected Problems
- Annotated Bibliography
- Index
6 - Recursive Functions
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- Preface
- COMPUTABILITY THEORY
- 1 Enumerability
- 2 Diagonalization
- 3 Turing Computability
- 4 Uncomputability
- 5 Abacus Computability
- 6 Recursive Functions
- 7 Recursive Sets and Relations
- 8 Equivalent Definitions of Computability
- BASIC METALOGIC
- FURTHER TOPICS
- Hints for Selected Problems
- Annotated Bibliography
- Index
Summary
The intuitive notion of an effectively computable function is the notion of a function for which there are definite, explicit rules, following which one could in principle compute its value for any given arguments. This chapter studies an extensive class of effectively computable functions, the recursively computable, or simply recursive, functions. According to Church's thesis, these are in fact all the effectively computable functions. Evidence for Church's thesis will be developed in this chapter by accumulating examples of effectively computable functions that turn out to be recursive. The subclass of primitive recursive functions is introduced in section 6.1, and the full class of recursive functions in section 6.2. The next chapter contains further examples. The discussion of recursive computability in this chapter and the next is entirely independent of the discussion of Turing and abacus computability in the preceding three chapters, but in the chapter after next the three notions of computability will be proved equivalent to each other.
Primitive Recursive Functions
Intuitively, the notion of an effectively computable function f from natural numbers to natural numbers is the notion of a function for which there is a finite list of instructions that in principle make it possible to determine the value f(x1, …, xn) for any arguments x1, …, xn. The instructions must be so definite and explicit that they require no external sources of information and no ingenuity to execute.
- Type
- Chapter
- Information
- Computability and Logic , pp. 63 - 72Publisher: Cambridge University PressPrint publication year: 2002