# Primitive recursive function

In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all "for" loops (that is, an upper bound of the number of iterations of every loop is fixed before entering the loop). Primitive recursive functions form a strict subset of those general recursive functions that are also total functions.
The importance of primitive recursive functions lies in the fact that most computable functions that are studied in number theory (and more generally in mathematics) are primitive recursive. For example, addition and division, the factorial and exponential function, and the function which returns the nth prime are all primitive recursive. In fact, for showing that a computable function is primitive recursive, it suffices to show that its time complexity is bounded above by a primitive recursive function of the input size. It is hence not particularly easy to devise a computable function that is not primitive recursive; some examples are shown in section § Limitations below.
The set of primitive recursive functions is known as PR in computational complexity theory.

## Definition

A primitive recursive function takes a fixed number of arguments, each a natural number (nonnegative integer: {0, 1, 2, ...}), and returns a natural number. If it takes n arguments it is called n-ary.
The basic primitive recursive functions are given by these axioms:
* Constant functions $C_{n}^{k}$: For each natural number $n$ and every $k$, the k-ary constant function, defined by $C_{n}^{k}(x_{1},\ldots ,x_{k})\ {\stackrel {\mathrm {def} }{=}}\ n$, is primitive recursive.
* Successor function: The 1-ary successor function S, which returns the successor of its argument (see Peano postulates), that is, $S(x)\ {\stackrel {\mathrm {def} }{=}}\ x+1$, is primitive recursive.
* Projection functions $P_{i}^{k}$: For all natural numbers $i,k$ such that $1\leq i\leq k$, the k-ary function defined by $P_{i}^{k}(x_{1},\ldots ,x_{k})\ {\stackrel {\mathrm {def} }{=}}\ x_{i}$ is primitive recursive.
More complex primitive recursive functions can be obtained by applying the operations given by these axioms:
* Composition operator $\circ \,$ (also called the substitution operator): Given an m-ary function $h(x_{1},\ldots ,x_{m})\,$ and m k-ary functions $g_{1}(x_{1},\ldots ,x_{k}),\ldots ,g_{m}(x_{1},\ldots ,x_{k})$: $h\circ (g_{1},\ldots ,g_{m})\ {\stackrel {\mathrm {def} }{=}}\ f,\quad {\text{where}}\quad f(x_{1},\ldots ,x_{k})=h(g_{1}(x_{1},\ldots ,x_{k}),\ldots ,g_{m}(x_{1},\ldots ,x_{k})).$ For $m=1$, the ordinary function composition $h\circ g_{1}$ is obtained.
* Primitive recursion operator $\rho$: Given the k-ary function $g(x_{1},\ldots ,x_{k})\,$ and the (k + 2)-ary function $h(y,z,x_{1},\ldots ,x_{k})\,$:${\begin{aligned}\rho (g,h)&\ {\stackrel {\mathrm {def} }{=}}\ f,\quad {\text{where the }}(k+1){\text{-ary function }}f{\text{ is defined by}}\\f(0,x_{1},\ldots ,x_{k})&=g(x_{1},\ldots ,x_{k})\\f(S(y),x_{1},\ldots ,x_{k})&=h(y,f(y,x_{1},\ldots ,x_{k}),x_{1},\ldots ,x_{k}).\end{aligned}}$ Interpretation: The function $f$ acts as a for-loop from $0$ up to the value of its first argument. The rest of the arguments for $f$, denoted here with $x_{1},\ldots ,x_{k}$, are a set of initial conditions for the for-loop which may be used by it during calculations but which are immutable by it. The functions $g$ and $h$ on the right-hand side of the equations that define $f$ represent the body of the loop, which performs calculations. The function $g$ is used only once to perform initial calculations. Calculations for subsequent steps of the loop are performed by $h$. The first parameter of $h$ is fed the "current" value of the for-loop's index. The second parameter of $h$ is fed the result of the for-loop's previous calculations, from previous steps. The rest of the parameters for $h$ are those immutable initial conditions for the for-loop mentioned earlier. They may be used by $h$ to perform calculations but they will not themselves be altered by $h$.
The primitive recursive functions are the basic functions and those obtained from the basic functions by applying these operations a finite number of times.

## Examples

* $C_{0}^{1}$ is a 1-ary function which returns $0$ for every input: $C_{0}^{1}(x)=0$.
* $C_{1}^{1}$ is a 1-ary function which returns $1$ for every input: $C_{1}^{1}(x)=1$.
* $C_{3}^{0}$ is a 0-ary function, i.e. a constant: $C_{3}^{0}=3$.
* $P_{1}^{1}$ is the identity function on the natural numbers: $P_{1}^{1}(x)=x$.
* $P_{1}^{2}$ and $P_{2}^{2}$ is the left and right projection on natural number pairs, respectively: $P_{1}^{2}(x,y)=x$ and $P_{2}^{2}(x,y)=y$.
* $S\circ S$ is a 1-ary function that adds 2 to its input, $(S\circ S)(x)=x+2$.
* $S\circ C_{0}^{1}$ is a 1-ary function which returns 1 for every input: $(S\circ C_{0}^{1})(x)=S(C_{0}^{1}(x))=S(0)=1$. That is, $S\circ C_{0}^{1}$ and $C_{1}^{1}$ are the same function: $S\circ C_{0}^{1}=C_{1}^{1}$. In a similar way, every $C_{n}^{k}$ can be expressed as a composition of appropriately many $S$ and $C_{0}^{k}$. Moreover, $C_{0}^{k}$ equals $C_{0}^{1}\circ P_{1}^{k}$, since $C_{0}^{k}(x_{1},\ldots ,x_{k})=0=C_{0}^{1}(x_{1})=C_{0}^{1}(P_{1}^{k}(x_{1},\ldots ,x_{k}))=(C_{0}^{1}\circ P_{1}^{k})(x_{1},\ldots ,x_{k})$. For these reasons, some authors define $C_{n}^{k}$ only for $n=0$ and $k=1$.

### Addition

A definition of the 2-ary function $Add$, to compute the sum of its arguments, can be obtained using the primitive recursion operator $\rho$. To this end, the well-known equations
    ${\begin{array}{rcll}0+y&=&y&{\text{ and}}\\S(x)+y&=&S(x+y)&.\\\end{array}}$
are "rephrased in primitive recursive function terminology": In the definition of $\rho (g,h)$, the first equation suggests to choose $g=P_{1}^{1}$ to obtain $Add(0,y)=g(y)=y$; the second equation suggests to choose $h=S\circ P_{2}^{3}$ to obtain $Add(S(x),y)=h(x,Add(x,y),y)=(S\circ P_{2}^{3})(x,Add(x,y),y)=S(Add(x,y))$. Therefore, the addition function can be defined as $Add=\rho (P_{1}^{1},S\circ P_{2}^{3})$. As a computation example,
    ${\begin{array}{lll}&Add(1,7)\\=&\rho (P_{1}^{1},S\circ P_{2}^{3})\;(S(0),7)&{\text{ by Def. }}Add,S\\=&(S\circ P_{2}^{3})(0,Add(0,7),7)&{\text{ by case }}\rho (g,h)\;(S(...),...)\\=&S(Add(0,7))&{\text{ by Def. }}\circ ,P_{2}^{3}\\=&S(\;\rho (P_{1}^{1},S\circ P_{2}^{3})\;(0,7)\;)&{\text{ by Def. }}Add\\=&S(P_{1}^{1}(7))&{\text{ by case }}\rho (g,h)\;(0,...)\\=&S(7)&{\text{ by Def. }}P_{1}^{1}\\=&8&{\text{ by Def. }}S.\\\end{array}}$

### Doubling

Given $Add$, the 1-ary function $Add\circ (P_{1}^{1},P_{1}^{1})$ doubles its argument, $(Add\circ (P_{1}^{1},P_{1}^{1}))(x)=Add(x,x)=x+x$.

### Multiplication

In a similar way as addition, multiplication can be defined by $Mul=\rho (C_{0}^{1},Add\circ (P_{2}^{3},P_{3}^{3}))$. This reproduces the well-known multiplication equations:
    ${\begin{array}{lll}&Mul(0,y)\\=&\rho (C_{0}^{1},Add\circ (P_{2}^{3},P_{3}^{3}))\;(0,y)&{\text{ by Def. }}Mul\\=&C_{0}^{1}(y)&{\text{ by case }}\rho (g,h)\;(0,...)\\=&0&{\text{ by Def. }}C_{0}^{1}.\\\end{array}}$
and
    ${\begin{array}{lll}&Mul(S(x),y)\\=&\rho (C_{0}^{1},Add\circ (P_{2}^{3},P_{3}^{3}))\;(S(x),y)&{\text{ by Def. }}Mul\\=&(Add\circ (P_{2}^{3},P_{3}^{3}))\;(x,Mul(x,y),y)&{\text{ by case }}\rho (g,h)\;(S(...),...)\\=&Add(Mul(x,y),y)&{\text{ by Def. }}\circ ,P_{2}^{3},P_{3}^{3}\\=&Mul(x,y)+y&{\text{ by property of }}Add.\\\end{array}}$

### Predecessor

The predecessor function acts as the "opposite" of the successor function and is recursively defined by the rules $Pred(0)=0$ and $Pred(S(n))=n$. A primitive recursive definition is $Pred=\rho (C_{0}^{0},P_{1}^{2})$. As a computation example,
    ${\begin{array}{lll}&Pred(8)\\=&\rho (C_{0}^{0},P_{1}^{2})\;(S(7))&{\text{ by Def. }}Pred,S\\=&P_{1}^{2}(7,Pred(7))&{\text{ by case }}\rho (g,h)\;(S(...),...)\\=&7&{\text{ by Def. }}P_{1}^{2}.\\\end{array}}$

### Truncated subtraction

The limited subtraction function (also called "monus", and denoted "${\stackrel {.}{-}}$") is definable from the predecessor function. It satisfies the equations
    ${\begin{array}{rcll}y{\stackrel {.}{-}}0&=&y&{\text{and}}\\y{\stackrel {.}{-}}S(x)&=&Pred(y{\stackrel {.}{-}}x)&.\\\end{array}}$
Since the recursion runs over the second argument, we begin with a primitive recursive definition of the reversed subtraction, $RSub(y,x)=x{\stackrel {.}{-}}y$. Its recursion then runs over the first argument, so its primitive recursive definition can be obtained, similar to addition, as $RSub=\rho (P_{1}^{1},Pred\circ P_{2}^{3})$. To get rid of the reversed argument order, then define $Sub=RSub\circ (P_{2}^{2},P_{1}^{2})$. As a computation example,
    ${\begin{array}{lll}&Sub(8,1)\\=&(RSub\circ (P_{2}^{2},P_{1}^{2}))\;(8,1)&{\text{ by Def. }}Sub\\=&RSub(1,8)&{\text{ by Def. }}\circ ,P_{2}^{2},P_{1}^{2}\\=&\rho (P_{1}^{1},Pred\circ P_{2}^{3})\;(S(0),8)&{\text{ by Def. }}RSub,S\\=&(Pred\circ P_{2}^{3})\;(0,RSub(0,8),8)&{\text{ by case }}\rho (g,h)\;(S(...),...)\\=&Pred(RSub(0,8))&{\text{ by Def. }}\circ ,P_{2}^{3}\\=&Pred(\;\rho (P_{1}^{1},Pred\circ P_{2}^{3})\;(0,8)\;)&{\text{ by Def. }}RSub\\=&Pred(P_{1}^{1}(8))&{\text{ by case }}\rho (g,h)\;(0,...)\\=&Pred(8)&{\text{ by Def. }}P_{1}^{1}\\=&7&{\text{ by property of }}Pred.\\\end{array}}$

### Converting predicates to numeric functions

In some settings it is natural to consider primitive recursive functions that take as inputs tuples that mix numbers with truth values (that is $t$ for true and $f$ for false), or that produce truth values as outputs. This can be accomplished by identifying the truth values with numbers in any fixed manner. For example, it is common to identify the truth value $t$ with the number $1$ and the truth value $f$ with the number $0$. Once this identification has been made, the characteristic function of a set $A$, which always returns $1$ or $0$, can be viewed as a predicate that tells whether a number is in the set $A$. Such an identification of predicates with numeric functions will be assumed for the remainder of this article.

### Predicate "Is zero"

As an example for a primitive recursive predicate, the 1-ary function $IsZero$ shall be defined such that $IsZero(x)=1$ if $x=0$, and $IsZero(x)=0$, otherwise. This can be achieved by defining $IsZero=\rho (C_{1}^{0},C_{0}^{2})$. Then, $IsZero(0)=\rho (C_{1}^{0},C_{0}^{2})(0)=C_{1}^{0}(0)=1$ and e.g. $IsZero(8)=\rho (C_{1}^{0},C_{0}^{2})(S(7))=C_{0}^{2}(7,IsZero(7))=0$.

### Predicate "Less or equal"

Using the property $x\leq y\iff x{\stackrel {.}{-}}y=0$, the 2-ary function $Leq$ can be defined by $Leq=IsZero\circ Sub$. Then $Leq(x,y)=1$ if $x\leq y$, and $Leq(x,y)=0$, otherwise. As a computation example,
    ${\begin{array}{lll}&Leq(8,3)\\=&IsZero(Sub(8,3))&{\text{ by Def. }}Leq\\=&IsZero(5)&{\text{ by property of }}Sub\\=&0&{\text{ by property of }}IsZero\\\end{array}}$

### Predicate "Greater or equal"

Once a definition of $Leq$ is obtained, the converse predicate can be defined as $Geq=Leq\circ (P_{2}^{2},P_{1}^{2})$. Then, $Geq(x,y)=Leq(y,x)$ is true (more precisely: has value 1) if, and only if, $x\geq y$.

### If-then-else

The 3-ary if-then-else operator known from programming languages can be defined by ${\textit {If}}=\rho (P_{2}^{2},P_{3}^{4})$. Then, for arbitrary $x$,
    ${\begin{array}{lll}&{\textit {If}}(S(x),y,z)\\=&\rho (P_{2}^{2},P_{3}^{4})\;(S(x),y,z)&{\text{ by Def. }}{\textit {If}}\\=&P_{3}^{4}(x,{\textit {If}}(x,y,z),y,z)&{\text{ by case }}\rho (S(...),...)\\=&y&{\text{ by Def. }}P_{3}^{4}\\\end{array}}$
and
    ${\begin{array}{lll}&{\textit {If}}(0,y,z)\\=&\rho (P_{2}^{2},P_{3}^{4})\;(0,y,z)&{\text{ by Def. }}{\textit {If}}\\=&P_{2}^{2}(y,z)&{\text{ by case }}\rho (0,...)\\=&z&{\text{ by Def. }}P_{2}^{2}.\\\end{array}}$.
That is, ${\textit {If}}(x,y,z)$ returns the then-part, $y$, if the if-part, $x$, is true, and the else-part, $z$, otherwise.

### Junctors

Based on the ${\textit {If}}$ function, it is easy to define logical junctors. For example, defining $And={\textit {If}}\circ (P_{1}^{2},P_{2}^{2},C_{0}^{2})$, one obtains $And(x,y)={\textit {If}}(x,y,0)$, that is, $And(x,y)$ is true if, and only if, both $x$ and $y$ are true (logical conjunction of $x$ and $y$).
Similarly, $Or={\textit {If}}\circ (P_{1}^{2},C_{1}^{2},P_{2}^{2})$ and $Not={\textit {If}}\circ (P_{1}^{1},C_{0}^{1},C_{1}^{1})$ lead to appropriate definitions of disjunction and negation: $Or(x,y)={\textit {If}}(x,1,y)$ and $Not(x)={\textit {If}}(x,0,1)$.

### Equality predicate

Using the above functions $Leq$, $Geq$ and $And$, the definition $Eq=And\circ (Leq,Geq)$ implements the equality predicate. In fact, $Eq(x,y)=And(Leq(x,y),Geq(x,y))$ is true if, and only if, $x$ equals $y$.
Similarly, the definition $Lt=Not\circ Geq$ implements the predicate "less-than", and $Gt=Not\circ Leq$ implements "greater-than".

### Other operations on natural numbers

Exponentiation and primality testing are primitive recursive. Given primitive recursive functions $e$, $f$, $g$, and $h$, a function that returns the value of $g$ when $e\leq f$ and the value of $h$ otherwise is primitive recursive.

### Operations on integers and rational numbers

By using Gödel numberings, the primitive recursive functions can be extended to operate on other objects such as integers and rational numbers. If integers are encoded by Gödel numbers in a standard way, the arithmetic operations including addition, subtraction, and multiplication are all primitive recursive. Similarly, if the rationals are represented by Gödel numbers then the field operations are all primitive recursive.

### Some common primitive recursive functions

The following examples and definitions are from Kleene (1952, pp. 223–231). Many appear with proofs. Most also appear with similar names, either as proofs or as examples, in Boolos, Burgess & Jeffrey (2002, pp. 63–70) they add the logarithm lo(x, y) or lg(x, y) depending on the exact derivation.
In the following the mark " ' ", e.g. a', is the primitive mark meaning "the successor of", usually thought of as " +1", e.g. a +1 =$_{def}$ a'. The functions 16–20 and #G are of particular interest with respect to converting primitive recursive predicates to, and extracting them from, their "arithmetical" form expressed as Gödel numbers.
   * Addition: a+b
   * Multiplication: a×b
   * Exponentiation: a$^b$
   * Factorial a! : 0! = 1, a'! = a!×a'
   * pred(a): (Predecessor or decrement): If a > 0 then a−1 else 0
   * Proper subtraction a ∸ b: If a ≥ b then a−b else 0
   * Minimum(a$_1$, ... a$_n$)
   * Maximum(a$_1$, ... a$_n$)
   * Absolute difference: | a−b | =$_{def}$ (a ∸ b) + (b ∸ a)
   * ~sg(a): NOT[signum(a)]: If a=0 then 1 else 0
   * sg(a): signum(a): If a=0 then 0 else 1
   * a | b: (a divides b): If b=k×a for some k then 0 else 1
   * Remainder(a, b): the leftover if b does not divide a "evenly". Also called MOD(a, b)
   * a = b: sg | a − b | (Kleene's convention was to represent true by 0 and false by 1; presently, especially in computers, the most common convention is the reverse, namely to represent true by 1 and false by 0, which amounts to changing sg into ~sg here and in the next item)
   * a < b: sg( a' ∸ b )
   * Pr(a): a is a prime number Pr(a) =$_{def}$ a>1 & NOT(Exists c)$_{1<c<a}$ [ c|a ]
   * p$_i$: the i+1th prime number
   * (a)$_i$: exponent of p$_i$ in a: the unique x such that p$_i$$^x$|a & NOT(p$_i$$^{x'}$|a)
   * lh(a): the "length" or number of non-vanishing exponents in a
   * lo(a, b): (logarithm of a to base b): If a, b > 1 then the greatest x such that b$^x$ | a else 0
    In the following, the abbreviation x =$_{def}$ x$_1$, ... x$_n$; subscripts may be applied if the meaning requires.
* #A: A function φ definable explicitly from functions Ψ and constants q$_1$, ... q$_n$ is primitive recursive in Ψ.
* #B: The finite sum Σ$_{y<z}$ ψ(x, y) and product Π$_{y<z}$ψ(x, y) are primitive recursive in ψ.
* #C: A predicate P obtained by substituting functions χ$_1$,..., χ$_m$ for the respective variables of a predicate Q is primitive recursive in χ$_1$,..., χ$_m$, Q.
* #D: The following predicates are primitive recursive in Q and R:
      * NOT_Q(x) .
      * Q OR R: Q(x) V R(x),
      * Q AND R: Q(x) & R(x),
      * Q IMPLIES R: Q(x) → R(x)
      * Q is equivalent to R: Q(x) ≡ R(x)
* #E: The following predicates are primitive recursive in the predicate R:
      * (Ey)$_{y<z}$ R(x, y) where (Ey)$_{y<z}$ denotes "there exists at least one y that is less than z such that"
      * (y)$_{y<z}$ R(x, y) where (y)$_{y<z}$ denotes "for all y less than z it is true that"
      * μy$_{y<z}$ R(x, y). The operator μy$_{y<z}$ R(x, y) is a bounded form of the so-called minimization- or mu-operator: Defined as "the least value of y less than z such that R(x, y) is true; or z if there is no such value."
* #F: Definition by cases: The function defined thus, where Q$_1$, ..., Q$_m$ are mutually exclusive predicates (or "ψ(x) shall have the value given by the first clause that applies), is primitive recursive in φ$_1$, ..., Q$_1$, ... Q$_m$:
       φ(x) =
      * φ$_1$(x) if Q$_1$(x) is true,
      * φ$_m$(x) if Q$_m$(x) is true
      * φ$_{m+1}$(x) otherwise
* #G: If φ satisfies the equation:
       φ(y,x) = χ(y, COURSE-φ(y; x$_2$, ... x$_n$ ), x$_2$, ... x$_n$ then φ is primitive recursive in χ. The value COURSE-φ(y; x$_{2ton}$ ) of the course-of-values function encodes the sequence of values φ(0,x$_{2ton}$), ..., φ(y-1,x$_{2ton}$) of the original function.

## Relationship to recursive functions

The broader class of partial recursive functions is defined by introducing an unbounded search operator. The use of this operator may result in a partial function, that is, a relation with at most one value for each argument, but does not necessarily have any value for any argument (see domain). An equivalent definition states that a partial recursive function is one that can be computed by a Turing machine. A total recursive function is a partial recursive function that is defined for every input.
Every primitive recursive function is total recursive, but not all total recursive functions are primitive recursive. The Ackermann function A(m,n) is a well-known example of a total recursive function (in fact, provable total), that is not primitive recursive. There is a characterization of the primitive recursive functions as a subset of the total recursive functions using the Ackermann function. This characterization states that a function is primitive recursive if and only if there is a natural number m such that the function can be computed by a Turing machine that always halts within A(m,n) or fewer steps, where n is the sum of the arguments of the primitive recursive function.
An important property of the primitive recursive functions is that they are a recursively enumerable subset of the set of all total recursive functions (which is not itself recursively enumerable). This means that there is a single computable function f(m,n) that enumerates the primitive recursive functions, namely:
* For every primitive recursive function g, there is an m such that g(n) = f(m,n) for all n, and
* For every m, the function h(n) = f(m,n) is primitive recursive.
f can be explicitly constructed by iteratively repeating all possible ways of creating primitive recursive functions. Thus, it is provably total. One can use a diagonalization argument to show that f is not recursive primitive in itself: had it been such, so would be h(n) = f(n,n)+1. But if this equals some primitive recursive function, there is an m such that h(n) = f(m,n) for all n, and then h(m) = f(m,m), leading to contradiction.
However, the set of primitive recursive functions is not the largest recursively enumerable subset of the set of all total recursive functions. For example, the set of provably total functions (in Peano arithmetic) is also recursively enumerable, as one can enumerate all the proofs of the theory. While all primitive recursive functions are provably total, the converse is not true.

## Limitations

Primitive recursive functions tend to correspond very closely with our intuition of what a computable function must be. Certainly the initial functions are intuitively computable (in their very simplicity), and the two operations by which one can create new primitive recursive functions are also very straightforward. However, the set of primitive recursive functions does not include every possible total computable function—this can be seen with a variant of Cantor's diagonal argument. This argument provides a total computable function that is not primitive recursive. A sketch of the proof is as follows:
$n$
$n$
$n$
$n$
$f_{n}$
Now define the "evaluator function" $ev$ with two arguments, by $ev(i,j)=f_{i}(j)$. Clearly $ev$ is total and computable, since one can effectively determine the definition of $f_{i}$, and being a primitive recursive function $f_{i}$ is itself total and computable, so $f_{i}(j)$ is always defined and effectively computable. However a diagonal argument will show that the function $ev$ of two arguments is not primitive recursive.
$ev$
$g$
$g(i)=S(ev(i,i))$
$ev$
$g$
$n$
$g=f_{n}$
$g(n)=S(ev(n,n))=S(f_{n}(n))=S(g(n))$
This argument can be applied to any class of computable (total) functions that can be enumerated in this way, as explained in the article Machine that always halts. Note however that the partial computable functions (those that need not be defined for all arguments) can be explicitly enumerated, for instance by enumerating Turing machine encodings.
Other examples of total recursive but not primitive recursive functions are known:
* The function that takes m to Ackermann(m,m) is a unary total recursive function that is not primitive recursive.
* The Paris–Harrington theorem involves a total recursive function that is not primitive recursive.
* The Sudan function
* The Goodstein function

## Variants
### Constant functions

Instead of $C_{n}^{k}$, alternative definitions use just one 0-ary zero function $C_{0}^{0}$ as a primitive function that always returns zero, and built the constant functions from the zero function, the successor function and the composition operator.

### Iterative functions

Robinson considered various restrictions of the recursion rule. One is the so-called iteration rule where the function h does not have access to the parameters x$_i$ (in this case, we may assume without loss of generality that the function g is just the identity, as the general case can be obtained by substitution):
    ${\begin{aligned}f(0,x)&=x,\\f(S(y),x)&=h(y,f(y,x)).\end{aligned}}$
He proved that the class of all primitive recursive functions can still be obtained in this way.

### Pure recursion

Another restriction considered by Robinson is pure recursion, where h does not have access to the induction variable y:
    ${\begin{aligned}f(0,x_{1},\ldots ,x_{k})&=g(x_{1},\ldots ,x_{k}),\\f(S(y),x_{1},\ldots ,x_{k})&=h(f(y,x_{1},\ldots ,x_{k}),x_{1},\ldots ,x_{k}).\end{aligned}}$
Gladstone proved that this rule is enough to generate all primitive recursive functions. Gladstone improved this so that even the combination of these two restrictions, i.e., the pure iteration rule below, is enough:
    ${\begin{aligned}f(0,x)&=x,\\f(S(y),x)&=h(f(y,x)).\end{aligned}}$
Further improvements are possible: Severin prove that even the pure iteration rule without parameters, namely
    ${\begin{aligned}f(0)&=0,\\f(S(y))&=h(f(y)),\end{aligned}}$
suffices to generate all unary primitive recursive functions if we extend the set of initial functions with truncated subtraction x ∸ y. We get all primitive recursive functions if we additionally include + as an initial function.

### Additional primitive recursive forms

Some additional forms of recursion also define functions that are in fact primitive recursive. Definitions in these forms may be easier to find or more natural for reading or writing. Course-of-values recursion defines primitive recursive functions. Some forms of mutual recursion also define primitive recursive functions.
The functions that can be programmed in the LOOP programming language are exactly the primitive recursive functions. This gives a different characterization of the power of these functions. The main limitation of the LOOP language, compared to a Turing-complete language, is that in the LOOP language the number of times that each loop will run is specified before the loop begins to run.

### Computer language definition

An example of a primitive recursive programming language is one that contains basic arithmetic operators (e.g. + and −, or ADD and SUBTRACT), conditionals and comparison (IF-THEN, EQUALS, LESS-THAN), and bounded loops, such as the basic for loop, where there is a known or calculable upper bound to all loops (FOR i FROM 1 TO n, with neither i nor n modifiable by the loop body). No control structures of greater generality, such as while loops or IF-THEN plus GOTO, are admitted in a primitive recursive language.
The LOOP language, introduced in a 1967 paper by Albert R. Meyer and Dennis M. Ritchie, is such a language. Its computing power coincides with the primitive recursive functions. A variant of the LOOP language is Douglas Hofstadter's BlooP in Gödel, Escher, Bach. Adding unbounded loops (WHILE, GOTO) makes the language general recursive and Turing-complete, as are all real-world computer programming languages.
The definition of primitive recursive functions implies that their computation halts on every input (after a finite number of steps). On the other hand, the halting problem is undecidable for general recursive functions.

## Finitism and consistency results

The primitive recursive functions are closely related to mathematical finitism, and are used in several contexts in mathematical logic where a particularly constructive system is desired. Primitive recursive arithmetic (PRA), a formal axiom system for the natural numbers and the primitive recursive functions on them, is often used for this purpose.
PRA is much weaker than Peano arithmetic, which is not a finitistic system. Nevertheless, many results in number theory and in proof theory can be proved in PRA. For example, Gödel's incompleteness theorem can be formalized into PRA, giving the following theorem:
    If T is a theory of arithmetic satisfying certain hypotheses, with Gödel sentence G$_T$, then PRA proves the implication Con(T)→G$_T$.
Similarly, many of the syntactic results in proof theory can be proved in PRA, which implies that there are primitive recursive functions that carry out the corresponding syntactic transformations of proofs.
In proof theory and set theory, there is an interest in finitistic consistency proofs, that is, consistency proofs that themselves are finitistically acceptable. Such a proof establishes that the consistency of a theory T implies the consistency of a theory S by producing a primitive recursive function that can transform any proof of an inconsistency from S into a proof of an inconsistency from T. One sufficient condition for a consistency proof to be finitistic is the ability to formalize it in PRA. For example, many consistency results in set theory that are obtained by forcing can be recast as syntactic proofs that can be formalized in PRA.

## History

Recursive definitions had been used more or less formally in mathematics before, but the construction of primitive recursion is traced back to Richard Dedekind's theorem 126 of his Was sind und was sollen die Zahlen? (1888). This work was the first to give a proof that a certain recursive construction defines a unique function.
Primitive recursive arithmetic was first proposed by Thoralf Skolem in 1923.
The current terminology was coined by Rózsa Péter (1934) after Ackermann had proved in 1928 that the function which today is named after him was not primitive recursive, an event which prompted the need to rename what until then were simply called recursive functions.