For 10 points, name this programming technique invoked when a function calls itself.
The use of this technique to solve optimization problems is evaluated by the Bellman equation and is known as dynamic programming. This programming technique has a tail form that can always be converted to loops. Functions that are effectively calculable by this process via the lambda calculus are the subject of the Church-Turing thesis. A method for finding the factorial of n uses this technique by multiplying n by the factorial of n - 1 until the function hits its base case. For 10 points, name this programming technique invoked when a function calls itself.
The use of this technique to solve optimization problems is evaluated by the Bellman equation and is known as dynamic programming.
{recursion} [accept word forms, accept {dynamic programming} before mention]