plural of crock recursion

(computing) The condition in which a program or document either directly or indirectly requests that it include itself, without protection against an endless sequence of continued requests to include itself.

An acronym in which a word (often the first) of the phrase represented by the acronym is the acronym itself.

(programming) Employing tail recursion.

(computing) Any function that uses recursion and can call itself until a certain condition is met

(mathematics) Of a function, capable of being constructed from the zero function, successor function, and projection functions, by a finite number of applications of composition and recursion.

(computing theory) Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others.

plural of recursive acronym

(semantics) A definition of a term within which the term itself appears, and that is well-founded, avoiding an infinite regress.

(computing) Describing a definition, particularly of an algorithm, given in terms of its output, rather than its input.