One function exhibiting the "mu" type of this technique that isn't also of the "primitive" type is the Ackermann function. The stack space used by this technique can be decreased by using the "tail" type of it. It is often us
One function exhibiting the "mu" type of this technique that isn't also of the "primitive" type is the Ackermann function. The stack space used by this technique can be decreased by using the "tail" type of it. It is often used to implement the factorial function, solve the Towers of Hanoi problem, and calculate the Fibonacci sequence. For 10 points, name this programming technique, often contrasted with iteration, in which a function calls itself.
One function exhibiting the "mu" type of this technique that isn't also of the "primitive" type is the Ackermann function.
{recursion} [or {recursivity}; or {recursive functions}; accept word forms]