Neblux

Neblux Knowledge Graph

Recursion

Recursion is the principle by which a process, function, or structure is defined in terms of simpler or smaller instances of itself.

Type: Concept Domain: Mathematics Technology

Overview

Recursion appears in mathematics, logic, and computer science as a powerful tool for defining and computing with self-referential structures. In mathematics, recursive definitions appear in the Peano axioms for natural numbers and in inductively defined sequences. In logic, the notion of recursive functions, formalized in the 1930s by Gödel and Kleene, is central to computability theory. In computer science, recursive algorithms such as merge sort and depth-first search decompose problems into smaller subproblems, often yielding elegant and efficient solutions. A key requirement for a well-defined recursive process is a base case that halts the self-reference chain.

Why it matters

Recursion is foundational to programming languages, enabling the implementation of complex data structures such as trees and graphs through self-referential definitions. It shaped the design of functional programming languages like Lisp and Haskell. The concept also appears in linguistics, where recursive phrase structure rules explain the infinite generativity of human language. In visual art and music, recursive patterns generate self-similar structures that have influenced generative art and algorithmic composition. The broader philosophical significance of self-reference — explored by Gödel's theorems and Hofstadter's influential writings — makes recursion one of the key intellectual concepts of the 20th century.

What it builds on

Related concepts

Appears in Wonders

Open this concept in the interactive graph →
EN