General recursive function

Operators (the domain of a function defined by an operator is the set of the values of the arguments such that every function application that must be done during the computation provides a well-defined result):

holds if and only if for any choice of arguments either both functions are defined and their values are equal or both functions are undefined.

Examples not involving the minimization operator can be found at Primitive recursive function#Examples.

The following examples are intended just to demonstrate the use of the minimization operator; they could also be defined without it, albeit in a more complicated way, since they are all primitive recursive.

The following examples define general recursive functions that are not primitive recursive; hence they cannot avoid using the minimization operator.

Example: Kleene gives an example of how to perform the recursive derivation of f(b, a) = b + a (notice reversal of variables a and b). He starts with 3 initial functions

On pages 210-215 Minsky shows how to create the μ-operator using the register machine model, thus demonstrating its equivalence to the general recursive functions.