Primitive recursive function: Difference between revisions

Revision as of 18:28, 19 December 2003

Revision as of 09:34, 27 December 2003

Line 68:

One can also explicitly exhibit a simple 1-ary computable function which is recursively defined for any natural number, but which is not primitive recursive, see [[Ackermann function]].

=== Relation to the reecursiverecursive functions ===

The set of primitive recursive functions does not encompass everything that we think of as computable. Nevertheless they form an important class and many of the functions normally studied in number theory, and approximations to real-valued functions, are primitive recursive.