The set S is the range of a primitive recursive function or empty.

In the following we observe that primitive recursive functions can be of four types:

Some forms of mutual recursion also define primitive recursive functions.

This n value represents the number of Gaussian primitive functions comprising a single basis function.

It allows a more natural style of expressing computation than simply using primitive recursive functions.

The creation of art itself may be modeled off of this primitive neural function.

Thus most of life goes on requiring only the "primitive recursive functions."

However, the struggle to deny the finality of death, co-opted and changed these primitive functions.

The languages contain a rich set of primitive functions designed for processing arrays.

The problem of integration regarded as the search for a primitive function is the keynote of the book.