drawing upon itself, referring back. / (mathematics, not comparable) of an expression, each term of which is determined by applying a formula to preceding terms

The quality of being recursive.

plural of recursivity

(computing theory) Recursion to a fixed depth. / (computing theory) The operator 𝜌, that creates a new function from two functions g, and h, such that:

plural of infinite recursion

(programming) The technique of writing a function so that recursive calls are only done immediately before function return, particularly when recursive control structures are used in place of iterative ones.

(logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function on the natural numbers to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?".

(programming) Any recursion that continues without end.

The case in which a string (in a language) may be decomposed to another string and a suffix

plural of tail recursion