In the study of effective computability, a particular way of defining a new function in terms of other simpler ones. The functions involved are functions over the nonnegative integers. Primitive recursion is then the process of defining a function f of n+1 variables in the following manner:
where
g and
h are functions of
n and
n+2 variables respectively.
See also primitive recursive function.