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:
“Children can’t make their own rules and no child is happy without them. The great need of the young is for authority that protects them against the consequences of their own primitive passions and their lack of experience, that provides with guides for everyday behavior and that builds some solid ground they can stand on for the future.”
—Leontine Young (20th century)
“It is not the function of our Government to keep the citizen from falling into error; it is the function of the citizen to keep the Government from falling into error.”
—Robert H. [Houghwout] Jackson (1892–1954)