Primitive Recursive Function
The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the total µ-recursive functions (µ-recursive functions are also called partial recursive). The term was coined by Rózsa Péter.
In computability theory, primitive recursive functions are a class of functions that form an important building block on the way to a full formalization of computability. These functions are also important in proof theory.
Most of the functions normally studied in number theory are primitive recursive. For example: addition, division, factorial, exponential and the nth prime are all primitive recursive. So are many approximations to real-valued functions. In fact, it is difficult to devise a computable function that is not primitive recursive, although some are known (see the section on Limitations below). The set of primitive recursive functions is known as PR in complexity theory.
Every primitive recursive function is a general recursive function.
Read more about Primitive Recursive Function: Definition, Examples, Relationship To Recursive Functions, Limitations, Some Common Primitive Recursive Functions, Additional Primitive Recursive Forms, Finitism and Consistency Results
Famous quotes containing the words primitive and/or function:
“An Englishman, methinks,—not to speak of other European nations,—habitually regards himself merely as a constituent part of the English nation; he is a member of the royal regiment of Englishmen, and is proud of his company, as he has reason to be proud of it. But an American—one who has made tolerable use of his opportunities—cares, comparatively, little about such things, and is advantageously nearer to the primitive and the ultimate condition of man in these respects.”
—Henry David Thoreau (1817–1862)
“The function of muscle is to pull and not to push, except in the case of the genitals and the tongue.”
—Leonardo Da Vinci (1425–1519)