Binary search uses this process to repeatedly divide a list into halves.
The Ackermann function cannot be expressed without using this procedure, and every effectively calculable function is general this by Church's thesis. All functions defined by course-of-values this are primitive this, and operations expressed using the "tail" form of this may easily be translated into (*) iteration. Binary search uses this process to repeatedly divide a list into halves. Often used to calculate elements of the Fibonacci sequence or values of the factorial function, for 10 points, name this process wherein a function calls itself.
The Ackermann function cannot be expressed without using this procedure, and every effectively calculable function is general this by Church's thesis.
{recursion} [or word forms {such} as {recursive}]