|
|
Definition of Primitive recursive
1. Adjective. (mathematics) Of a function, capable of being constructed from the zero function, successor function, and projection functions, by a finite number of applications of composition and recursion. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Primitive Recursive
Other Resources:
