primitive recursive function
primitive recursive function A function that can be obtained from certain initial functions by a finite number of applications of composition and primitive recursion. The initial functions are normally the zero function, successor function, and projection (or generalized identity) functions, where all functions are defined on the nonnegative integers. Primitive recursive functions are total functions, defined in a simple way by induction. There is also a notion of primitive recursive set, namely one whose characteristic function is primitive recursive.
The arithmetic functions of addition and multiplication are examples of primitive recursive functions. Indeed most of the functions and sets on natural numbers that we wish to compute are primitive recursive.
The idea can be generalized: for example, a primitive recursive function on lists satisfies a definition analogous to the one given above, with the successor function adding an element to the front of a list.
See also recursive function.
Cite this article
Pick a style below, and copy the text for your bibliography.

MLA

Chicago

APA
"primitive recursive function." A Dictionary of Computing. . Encyclopedia.com. 21 Jan. 2019 <https://www.encyclopedia.com>.
"primitive recursive function." A Dictionary of Computing. . Encyclopedia.com. (January 21, 2019). https://www.encyclopedia.com/computing/dictionariesthesaurusespicturesandpressreleases/primitiverecursivefunction
"primitive recursive function." A Dictionary of Computing. . Retrieved January 21, 2019 from Encyclopedia.com: https://www.encyclopedia.com/computing/dictionariesthesaurusespicturesandpressreleases/primitiverecursivefunction
Citation styles
Encyclopedia.com gives you the ability to cite reference entries and articles according to common styles from the Modern Language Association (MLA), The Chicago Manual of Style, and the American Psychological Association (APA).
Within the “Cite this article” tool, pick a style to see how all available information looks when formatted according to that style. Then, copy and paste the text into your bibliography or works cited list.
Because each style has its own formatting nuances that evolve over time and not all information is available for every reference entry or article, Encyclopedia.com cannot guarantee each citation it generates. Therefore, it’s best to use Encyclopedia.com citations as a starting point before checking the style against your school or publication’s requirements and the mostrecent information available at these sites:
Modern Language Association
The Chicago Manual of Style
http://www.chicagomanualofstyle.org/tools_citationguide.html
American Psychological Association
Notes:
 Most online reference entries and articles do not have page numbers. Therefore, that information is unavailable for most Encyclopedia.com content. However, the date of retrieval is often important. Refer to each style’s convention regarding the best way to format page numbers and retrieval dates.
 In addition to the MLA, Chicago, and APA styles, your school, university, publication, or institution may have its own requirements for citations. Therefore, be sure to refer to those guidelines when editing your bibliography or works cited list.
primitive recursion
primitive recursion In the study of effective computability, a particular way of defining a new function in terms of other simpler ones. The functions involved are functions over the nonnegative integers. Primitive recursion is then the process of defining a function f of n+1 variables in the following manner: f(x_{1},x_{2},…x_{n},0) = g(x_{1},x_{2},…x_{n}), f(x_{1},x_{2},…x_{n},y+1) = h(x_{1},x_{2},…x_{n},y,f(x_{1},…x_{n},y))
where g and h are functions of n and n+2 variables respectively. See also primitive recursive function.
Cite this article
Pick a style below, and copy the text for your bibliography.

MLA

Chicago

APA
"primitive recursion." A Dictionary of Computing. . Encyclopedia.com. 21 Jan. 2019 <https://www.encyclopedia.com>.
"primitive recursion." A Dictionary of Computing. . Encyclopedia.com. (January 21, 2019). https://www.encyclopedia.com/computing/dictionariesthesaurusespicturesandpressreleases/primitiverecursion
"primitive recursion." A Dictionary of Computing. . Retrieved January 21, 2019 from Encyclopedia.com: https://www.encyclopedia.com/computing/dictionariesthesaurusespicturesandpressreleases/primitiverecursion
Citation styles
Encyclopedia.com gives you the ability to cite reference entries and articles according to common styles from the Modern Language Association (MLA), The Chicago Manual of Style, and the American Psychological Association (APA).
Within the “Cite this article” tool, pick a style to see how all available information looks when formatted according to that style. Then, copy and paste the text into your bibliography or works cited list.
Because each style has its own formatting nuances that evolve over time and not all information is available for every reference entry or article, Encyclopedia.com cannot guarantee each citation it generates. Therefore, it’s best to use Encyclopedia.com citations as a starting point before checking the style against your school or publication’s requirements and the mostrecent information available at these sites:
Modern Language Association
The Chicago Manual of Style
http://www.chicagomanualofstyle.org/tools_citationguide.html
American Psychological Association
Notes:
 Most online reference entries and articles do not have page numbers. Therefore, that information is unavailable for most Encyclopedia.com content. However, the date of retrieval is often important. Refer to each style’s convention regarding the best way to format page numbers and retrieval dates.
 In addition to the MLA, Chicago, and APA styles, your school, university, publication, or institution may have its own requirements for citations. Therefore, be sure to refer to those guidelines when editing your bibliography or works cited list.