primitive recursion
"Primitive recursion" is a foundational concept in computability theory, used to define functions in a structured and predictable manner.
🇺🇸 US Voice:
🇬🇧 UK Voice:
Definition
C2Computability Theory
(technical, academic)A method of defining functions where a function's value is determined by its values at smaller inputs, involving a base case and a recursive rule.
Example
- The addition of two numbers can be defined using primitive recursion.
C2Mathematical Logic
(technical, academic)A process of constructing functions from basic ones using fixed rules, ensuring the resulting functions are computable.
Example
- Primitive recursion is used to define the Fibonacci sequence in a formal mathematical manner.
Similar
Terms that have similar or relatively close meanings to "primitive recursion":