Lexic.us

Definition of Recursion

1. Noun. (mathematics) an expression such that each term is generated by repeating a particular mathematical operation.

Definition of Recursion

1. n. The act of recurring; return.

Definition of Recursion

1. Noun. The act of recurring. ¹

2. Noun. (mathematics) The act of defining an object (usually a function) in terms of that object itself. ¹

3. Noun. (computing) The calling of a function from within that same function. ¹

¹ Source: wiktionary.com

Definition of Recursion

1. [n -S]

Medical Definition of Recursion

1. The act of recurring; return. (Math) The calculation of a mathematical expression (or a quantity) by repeating an operation on another expression which was derived by application of the same operation, on an expression which itself was the result of similar repeated applications of that same operation on prior results. The series of operations is terminated by specifying an initial or terminal condition. (Computers) A programming technique in which a function calls itself as a subfunction. Such calls may be repeated in series to arbitrary depth, provided that a terminating condition is given so that the final (deepest) call will return a value (rather than continue to recurse), which then permits the next higher call to return a value, and so forth, until the original call returns a value to the calling program. Origin: L. Recursio. See Recur. Source: Websters Dictionary (01 Mar 1998)

Lexicographical Neighbors of Recursion

Literary usage of Recursion

Below you will find example usage of this term as found in modern and/or classical literature:

1. Geometric Computing Science: First Steps by Robert Hermann (1991)
"The recursion Relations of the Binomial Coefficients as an Example of a System of Partial Difference Equations and Solution as a Fixed Point In preceding ..."

2. State of the Art in Probability and Statistics: Festschrift for Willem R by Mathisca de Gunst, Chris Klaassen, A. W. van der Vaart (2001)
"1 Introduction The stochastic recursion (1.1) Rn = Qn + ... It is defined by the recursion Xn = {// + A^-1}1/2en, where ei,e2,... are independent standard ..."

3. Concrete Abstractions: An Introduction to Computer Science Using Scheme by Max Hailperin, Barbara Kaiser, Karl Knight (1999)
"... TWO recursion and Induction recursion We have used Scheme to write procedures that describe how certain computational processes can be carried out. ..."

4. Adaptive Statistical Procedures and Related Topics: Proceedings of a by Herbert Robbins, John Van Ryzin (1986)
"Consistency of maximum likelihood recursion in stochastic approximation. ... Maximum likelihood recursion and stochastic approximation in sequential designs ..."

5. Altova Xslt Accelerated by Altova, Altova Online Training (2005)
"recursion and variables Second challenge- • Print the characters of a word vertically down a page • For each character print the integer equivalent after it ..."

6. Progress Measures and Finite Arguments for Infinite Computations by Nils Klarlund (1990)
"D 7.3.3 recursion-Theoretic Discussion Assume that (4,i}i is an enumeration of the partial recursive functions from natural numbers to natural numbers. ..."

7. SAS 9.1 Macro Language: Reference by Institute SAS Institute, SAS Institute (2004)
"Open code recursion is when your open code erroneously causes a macro ... The most common error that causes open code recursion is a missing semicolon. ..."

Other Resources: