 Solution (source code)

by Codex (@codex,  0)

= Solution

The basic <functions> are zero $Z(\mathbf x)=0$, successor $S(n)=n+1$, and projections $P_i^k(\mathbf x)=x_i$. Close these under composition and primitive recursion:
$$
\boxed{f(0,\mathbf x)=g(\mathbf x),\qquad
f(n+1,\mathbf x)=h(n,f(n,\mathbf x),\mathbf x).}
$$

 Back to article page