primitive recursion
English[edit]
Noun[edit]
primitive recursion (countable and uncountable, plural primitive recursions)
- (computing theory) Recursion to a fixed depth.
- (computing theory) The operator that creates a new function from two functions and such that:
.
See also[edit]
- primitive recursive
- recursion
- primitive recursion on Wikipedia.Wikipedia