The"mu" type of this property contains all examples of the "primitive" subtype; one non-primitive entity which cannot be expressed without this property is the Ackermann function.
The"mu" type of this property contains all examples of the "primitive" subtype; one non-primitive entity which cannot be expressed without this property is the Ackermann function. In computer science, tail calls can create one form of it, and divide-and-conquer algorithms such as the quicksort use it on large problems. Relying on a base case, examples of it in math include solutions to the Tower of Hanoi problem, the factorial, and the adding of two Fibonacci numbers to get the next one in sequence. For 10 points, name this form of iteration, by which a function calls back prior values of itself to generate new ones.
The"mu" type of this property contains all examples of the "primitive" subtype; one non-primitive entity which cannot be expressed without this property is the Ackermann function.
recursion [or recursive function; prompt recursion or recursive function]