A process known as dynamic programming that uses the Bellman equation makes use of this technique to find solutions to optimization problems.
A process known as dynamic programming that uses the Bellman equation makes use of this technique to find solutions to optimization problems. Its "mu" type is expressed in the Ackermann function, and it is applied in lambda calculus to fix the Kleene-Rosser paradox. Its "tail" type can be expressed in (*) iteration, and use of this technique is present in the solution to the Towers of Hanoi problem. The Fibonacci sequence is often identified as this because it applies past terms. For 10 points, name this programming method in which a function calls itself.
A process known as dynamic programming that uses the Bellman equation makes use of this technique to find solutions to optimization problems.
{recursion} [accept word forms like {recursive}] [MB]