Unin

#primitive_recursive_function

Primitive recursive function

Function computable with bounded loops

In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all "for" loops. Primitive recursive functions form a strict subset of those general recursive functions that are also total functions.

Mon 19th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Primitive recursive function General recursive function Ackermann function Recursive function Primitive recursive arithmetic Successor function Primitive recursive set function Computable function Μ operator Primitive recursive functional

0 searches

This keyword has never been searched before

This keyword has never been searched for with any other keyword.