Primitive Recursive and μ-Recursive Functions

  • Klaus Weihrauch
Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 9)


In Chapter 1.2 we have defined the computable functions on ℕ using register machines. This definition enables good understanding of the concept of computability. In this chapter we define the computable functions in a quite different way. We first define the primitive recursive functions and then the μ-recursive functions and finally prove that the μ-recursive functions coincide with the (register) computable functions. The primitive recursive functions form a class of total computable functions which contains all (total) functions of practical interest. However this class is too large to be of real importance outside of mathematical logic and theoretical computer science.


Recursive Function Computable Function Universal Function Recursion Equation Theoretical Computer Science 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Klaus Weihrauch
    • 1
  1. 1.FB Mathematik und InformatikFern Universität HagenHagenGermany

Personalised recommendations