Recursion

Japanese-created Russian cultural icon: set of wooden dolls of decreasing size placed one inside another

philosophical paradox

recursive visual effect

order in which individual statements, instructions or function calls of an imperative program are executed or evaluated

algorithmic technique in computer science of solving a problem by reducing it to a smaller instance of the same problem

acronym whose meaning refers to itself

programming idiom

philosophical problem

method of proving that a certain property applies for all elements in a well-founded set

recursive subset of the set of all possible finite sequences over the alphabet of the language

class of algorithms

subroutine that calls itself as its final action

defining the elements in a set in terms of other elements in the set

function that can be computed with loops of bounded length

quality of subroutines and computer programs

family of higher-order functions that analyze a recursive data structure and build up a return value

form of recursion

Wikipedia list of recursive islands and lakes

expression of the problem of infinite regress

theory of computer science

higher-order function y for which y f = f (y f)

In mathematics, logic and philosophy of mathematics, something that is impredicative is a self-referencing definition. Roughly speaking, a definition is impredicative if it invokes (mentions or quantifies over) the set being defined, or (more commonly) another set that contains the thing being defined. There is no generally accepted precise definition of what it means to be predicative or impredicative. Authors have given different but related definitions.

the observer is an integral part of the system being observed

In computer science, corecursion is a type of operation that is dual to (structural) recursion. Whereas recursion consumes a data structure by first handling the topmost layer before descending into its inner parts, corecursion produces a data structure by first defining the topmost layer before defining its inner parts. Corecursion is a particularly important in total languages, as it allows encoding potentially non-terminating computations in a context where every function must terminate. It is supported by theorem provers Agda and Rocq.

hierarchical and recursive queries in SQL