Course-of-values recursion

In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of a function f by course-of-values recursion, the value of f(n) is computed from the sequence ⟨ f ( 0 ) , f ( 1 ) , … , f ( n − 1 ) ⟩ {\displaystyle \langle f(0),f(1),\ldots ,f(n-1)\rangle } .

Source: Wikipedia — Course-of-values recursion (CC BY-SA 4.0)