recursion


Also found in: Dictionary, Thesaurus, Wikipedia.
Related to recursion: recursion formula, Tail recursion

recursion

[ri′kər·zhən]
(computer science)
A technique in which an apparently circular process is used to perform an iterative process.

recursion

(mathematics, programming)
When a function (or procedure) calls itself. Such a function is called "recursive". If the call is via one or more other functions then this group of functions are called "mutually recursive".

If a function will always call itself, however it is called, then it will never terminate. Usually however, it first performs some test on its arguments to check for a "base case" - a condition under which it can return a value without calling itself.

The canonical example of a recursive function is factorial:

factorial 0 = 1 factorial n = n * factorial (n-1)

Functional programming languages rely heavily on recursion, using it where a procedural language would use iteration.

See also recursion, recursive definition, tail recursion.

recursion

In programming, the ability of a subroutine or program module to call itself. It is used to write routines that solve problems by repeatedly processing the output of the same process. See recurse subdirectories, circular reference and recursive descent parser.
References in periodicals archive ?
Recursion is one of a growing number of companies focused on drug repurposing and repositioning, a strategy that has gained traction because of the potential for more rapid translation to the clinic at lower costs compared to the traditional strategy of building new drugs from scratch.
We derive a backward and a forward recursion algorithms to compute this value in O(N) operations.
In the second example, we present a method to find roots of any order, again using recursion and averages.
Proof: The recursion was deduced in (Neumann and Sulzgruber, 2013, Theorem 4.
The recursion should stop at a certain basecase where a small ( say 2 x 2) explicit inverse is carefully computed and returned to a higher level in the recursion tree Compute x = [A.
In this section we derive a recursion formula for the probability distribution of the sum of j dice, using the probability distribution of the sum of j-1 dice.
Recursion (from the Latin recurrere, meaning to "run back") is the process through which one of the steps of a procedure calls for the complete procedure to be processed again from within the calling procedure.
Yet too much recursion and too little discussion inevitably lead to wrong assumptions.
On this way, Melman (Melman, 2006) has avoided the use of recursion for development of the first derivatives of even and odd characteristic polynomial and has minimized costs of first derivative computing.
Recursion is part of this instinct, or it is supposed to be, and Everett spent years trying to find evidence of this feature before he began to wonder if the shortcoming was not his but that of Chomsky's theory.
Each neighbor acts as the starting pixel P of the next stage of the recursion.
Recursion Software provides next-generation platforms and middleware designed for mobile communications and collaboration.