(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?".

plural of infinite recursion

(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 tail recursion

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

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.