recursive function

recursive function
Name	recursive function
Field	Mathematics; Computer Science
Introduced	1930s
Notable	Kurt Gödel; Alonzo Church; Alan Turing; Emil Post; Stephen Kleene

recursive function

A recursive function is a mathematical and computational construct defined in terms of itself, widely used in Kurt Gödel's work, Alonzo Church's lambda calculus, Alan Turing's machines, and Emil Post's production systems. It appears in formal studies by Stephen Kleene, in practical algorithms by John McCarthy, and in programming paradigms influenced by Edsger Dijkstra, Donald Knuth, and Tony Hoare. Recursive functions connect to foundational results such as the Gödel–Schmidt theorem, the Church–Turing thesis, and developments at institutions like Princeton University, Harvard University, and University of Cambridge.

Definition and Formal Properties

In formal treatments originating with Gödel, Kleene, and Church, a recursive function is specified via base cases and self-referential rules, often formalized with lambda calculus, Turing machine encodings, or via primitive recursion and minimization as in Kleene's classification. Foundational formal properties are studied alongside notions from David Hilbert's program, Emil Post's correspondence, and the Decision problem. Formal properties include closure under composition studied by researchers at University of Göttingen and the uniqueness results paralleling work by Henri Poincaré and Bertrand Russell.

Mathematical and Computability Theory

In computability theory, recursive functions are central to classifications like primitive recursive, partial recursive, and total recursive, reflecting results by Kleene, Turing, and Post. They underpin proofs of undecidability exemplified by the Halting problem and relate to completeness notions such as Turing completeness and the Rice's theorem family. Connections extend to complexity perspectives developed by Stephen Cook, Richard Karp, and institutions including Bell Labs and IBM Research where reductions and completeness concepts were refined. The role of recursion in arithmetic arises in work by Gerald Sacks and Solomon Feferman on formal theories like Peano arithmetic and models studied at Institute for Advanced Study.

Programming and Implementation Techniques

In programming, recursion is implemented in languages influenced by John McCarthy's Lisp, Robin Milner's ML, and Dennis Ritchie's C, and shaped by language designs at Bell Labs, Sun Microsystems, and academic groups at Massachusetts Institute of Technology. Implementations use mechanisms such as call stacks optimized via tail-call elimination introduced in compilers influenced by Christopher Strachey and formalized in standards by committees at ISO. Runtime support involves activation records and continuations explored by M. Felleisen and Gerald Jay Sussman, and optimizations like memoization used in engineering at Google and Microsoft Research.

Examples and Common Patterns

Common algorithmic examples include divide-and-conquer patterns in work by Jon Bentley and Thomas H. Cormen, recursive traversal patterns used in libraries from GNU Project and Apache Software Foundation, and mathematical recurrences studied by Leonhard Euler and Carl Friedrich Gauss. Classic implementations appear in textbooks by Donald Knuth, Robert Sedgewick, and Alfred Aho demonstrating quicksort, mergesort, tree traversals, and dynamic programming where recursion converts to iterative forms via stacks or memoization strategies used at Stanford University and in projects by Facebook.

Complexity, Termination, and Correctness

Analyzing recursive procedures involves time and space complexity frameworks developed by Alan Perlis and Edsger Dijkstra, termination proofs using well-founded orders popularized by Jean-Pierre Jouannaud and Pierre Lescanne, and verification techniques from Tony Hoare and Edmund Clarke incorporating model checking from Carnegie Mellon University. Correctness is addressed by induction principles rooted in the work of Blaise Pascal and formal proofs constructed with interactive theorem provers such as those from INRIA and Coq projects led by Gérard Huet and Thierry Coquand.

Variants and Extensions

Variants include primitive recursion, mu-recursion formalized by Kleene, higher-order recursion in lambda calculus as studied by Haskell Brooks Curry and Per Martin-Löf, structural recursion in languages designed by Xavier Leroy, and general recursion in systems influenced by Robin Milner and Gordon Plotkin. Extensions appear as co-recursion used in stream processing researched at Bell Labs and MIT Media Lab, guarded recursion in type theory advanced at University of Edinburgh, and ordinal-recursive schemes considered in proof theory by Wilfried Buchholz and Georg Kreisel.

Category:Computability theory