recursion

re·cur·sion  (r-kûrzhn)

n. Mathematics

1. An expression, such as a polynomial, each term of which is determined by application of a formula to preceding terms.

2. A formula that generates the successive terms of a recursion.

---

[Late Latin recursi, recursin-, a running back, from Latin recursus, past participle of recurrere, to run back; see recur.]

---

re·cursive adj.

---

recursion [rɪˈkɜːʃən]

n

1. the act or process of returning or running back

2. (Philosophy / Logic) (Mathematics) Logic Maths the application of a function to its own values to generate an infinite sequence of values. The recursion formula or clause of a definition specifies the progression from one term to the next, as given the base clause f(0) = 0, f(n + 1) = f(n) + 3 specifies the successive terms of the sequence f(n) = 3n

[from Latin recursio, from recurrere recur]

recursive  adj

Thesaurus

Noun

1.

recursion - (mathematics) an expression such that each term is generated by repeating a particular mathematical operation formula, rule - (mathematics) a standard procedure for solving a class of mathematical problems; "he determined the upper bound with Descartes' rule of signs"; "he gave us a general formula for attacking polynomials" math, mathematics, maths - a science (or group of related sciences) dealing with the logic of quantity and shape and arrangement