primitive recursive function
mathematics
Learn about this topic in these articles:
foundations of mathematics
- In foundations of mathematics: Recursive definitions
…S, and substitution) are called primitive recursive. Gödel used this concept to make precise what he meant by “effectively enumerable.” A set of natural numbers is said to be recursively enumerable if it consists of all f(n) with n ∊ ℕ, where f ∶ ℕ → ℕ is a primitive…
Read More