Recursion

Informal definition

Recursion is the process a procedure goes through when one of the steps of the procedure involves invoking the procedure itself. A procedure that goes through recursion is said to be 'recursive'.

To understand recursion, one must recognize the distinction between a procedure and the running of a procedure. A procedure is a set of steps based on a set of rules, while the running of a procedure involves actually following the rules and performing the steps.

Recursion is related to, but not the same as, a reference within the specification of a procedure to the execution of some other procedure.

When a procedure is thus defined, this immediately creates the possibility of an endless loop; recursion can only be properly used in a definition if the step in question is skipped in certain cases so that the procedure can complete.

Even if it is properly defined, a recursive procedure is not easy for humans to perform, as it requires distinguishing the new from the old, partially executed invocation of the procedure; this requires some administration as to how far various simultaneous instances of the procedures have progressed. For this reason, recursive definitions are very rare in everyday situations.

In language

Linguist Noam Chomsky, among many others, has argued that the lack of an upper bound on the number of grammatical sentences in a language, and the lack of an upper bound on grammatical sentence length (beyond practical constraints such as the time available to utter one), can be explained as the consequence of recursion in natural language.

There are many structures apart from sentences that can be defined recursively, and therefore many ways in which a sentence can embed instances of one category inside another. Over the years, languages in general have proved amenable to this kind of analysis.

The generally accepted idea that recursion is an essential property of human language has been challenged by Daniel Everett on the basis of his claims about the Pirahã language. Andrew Nevins, David Pesetsky and Cilene Rodrigues are among many who have argued against this. Literary self-reference can in any case be argued to be different in kind from mathematical or logical recursion.

Recursion plays a crucial role not only in syntax, but also in natural language semantics. The word and, for example, can be construed as a function that can apply to sentence meanings to create new sentences, and likewise for noun phrase meanings, verb phrase meanings, and others. It can also apply to intransitive verbs, transitive verbs, or ditransitive verbs. In order to provide a single denotation for it that is suitably flexible, and is typically defined so that it can take any of these different types of meanings as arguments. This can be done by defining it for a simple case in which it combines sentences, and then defining the other cases recursively in terms of the simple one.

A recursive grammar is a formal grammar that contains recursive production rules.

Recursive humor

Recursion is sometimes used humorously in computer science, programming, philosophy, or mathematics textbooks, generally by giving a circular definition or self-reference, in which the putative recursive step does not get closer to a base case, but instead leads to an infinite regress. It is not unusual for such books to include a joke entry in their glossary along the lines of:

Recursion, see Recursion.

A variation is found on page 269 in the index of some editions of Brian Kernighan and Dennis Ritchie's book The C Programming Language; the index entry recursively refers to itself ("recursion 86, 139, 141, 182, 202, 269"). Early versions of this joke can be found in Let's talk Lisp by Laurent Siklóssy (published by Prentice Hall PTR on December 1, 1975, with a copyright date of 1976) and in Software Tools by Kernighan and Plauger (published by Addison-Wesley Professional on January 11, 1976). The joke also appears in The UNIX Programming Environment by Kernighan and Pike. It did not appear in the first edition of The C Programming Language. The joke is part of the functional programming folklore and was already widespread in the functional programming community before the publication of the aforementioned books.

Another joke is that "To understand recursion, you must understand recursion." In the English-language version of the Google web search engine, when a search for "recursion" is made, the site suggests "Did you mean: recursion." An alternative form is the following, from Andrew Plotkin: "If you already know what recursion is, just remember the answer. Otherwise, find someone who is standing closer to Douglas Hofstadter than you are; then ask him or her what recursion is."

Recursive acronyms are other examples of recursive humor. PHP, for example, stands for "PHP Hypertext Preprocessor", WINE stands for "WINE Is Not an Emulator", RPM stands for "RPM Package manager", GNU stands for "GNU's not Unix", and SPARQL denotes the "SPARQL Protocol and RDF Query Language".

In mathematics

Recursively defined sets

Example: the natural numbers

The canonical example of a recursively defined set is given by the natural numbers:

0 is in ${\displaystyle \mathbb{N}}$

if n is in ${\displaystyle \mathbb{N}}$, then n + 1 is in ${\displaystyle \mathbb{N}}$

The set of natural numbers is the smallest set satisfying the previous two properties.

In mathematical logic, the Peano axioms (or Peano postulates or Dedekind–Peano axioms), are axioms for the natural numbers presented in the 19th century by the German mathematician Richard Dedekind and by the Italian mathematician Giuseppe Peano. The Peano Axioms define the natural numbers referring to a recursive successor function and addition and multiplication as recursive functions.

Example: Proof procedure

Another interesting example is the set of all "provable" propositions in an axiomatic system that are defined in terms of a proof procedure which is inductively (or recursively) defined as follows:

• If a proposition is an axiom, it is a provable proposition.
• If a proposition can be derived from true reachable propositions by means of inference rules, it is a provable proposition.
• The set of provable propositions is the smallest set of propositions satisfying these conditions.

Finite subdivision rules

Finite subdivision rules are a geometric form of recursion, which can be used to create fractal-like images. A subdivision rule starts with a collection of polygons labelled by finitely many labels, and then each polygon is subdivided into smaller labelled polygons in a way that depends only on the labels of the original polygon. This process can be iterated. The standard 'middle thirds' technique for creating the Cantor set is a subdivision rule, as is barycentric subdivision.

Functional recursion

A function may be recursively defined in terms of itself. A familiar example is the Fibonacci number sequence: F(n) = F(n − 1) + F(n − 2). For such a definition to be useful, it must be reducible to non-recursively defined values: in this case F(0) = 0 and F(1) = 1.

Proofs involving recursive definitions

Applying the standard technique of proof by cases to recursively defined sets or functions, as in the preceding sections, yields structural induction — a powerful generalization of mathematical induction widely used to derive proofs in mathematical logic and computer science.

Recursive optimization

Dynamic programming is an approach to optimization that restates a multiperiod or multistep optimization problem in recursive form. The key result in dynamic programming is the Bellman equation, which writes the value of the optimization problem at an earlier time (or earlier step) in terms of its value at a later time (or later step).

The recursion theorem

In set theory, this is a theorem guaranteeing that recursively defined functions exist. Given a set X, an element a of X and a function f: X → X, the theorem states that there is a unique function ${\displaystyle F:\mathbb{N}\to X}$ (where ${\displaystyle \mathbb{N}}$ denotes the set of natural numbers including zero) such that

${\displaystyle F(0)=a}$

${\displaystyle F(n+1)=f(F(n))}$

for any natural number n.

Dedekind was the first to pose the problem of unique definition of set-theoretical functions on ${\displaystyle \mathbb{N}}$ by recursion, and gave a sketch of an argument in the 1888 essay "Was sind und was sollen die Zahlen?"

Proof of existence

Source:

Let ${\displaystyle S=\{A\subseteq \mathbb{N}\times X:(0,a)\in A\text{ and if }(x,y)\in A\text{ then }(x+1,f(y))\in A\}}$.

S is not empty since ${\displaystyle \mathbb{N}\times X\in S}$. Let ${\displaystyle g=\bigcap _{A\in S}A}$. Now ${\displaystyle (0,a)\in g}$ since it is in all ${\displaystyle A\in S}$. Moreover, if ${\displaystyle (x,y)\in g}$ then ${\displaystyle (x,y)\in A}$ for all ${\displaystyle A\in S}$. But then ${\displaystyle (x+1,f(y))\in A}$ for all ${\displaystyle A\in S}$ so that ${\displaystyle (x+1,f(y))\in g}$. Therefore ${\displaystyle g\in S}$ and it is the smallest element of S.

Let ${\displaystyle T=\{n\in \mathbb{N}:\mathrm{\exists }z\in X\text{ such that }(n,z)\in g\}}$. Now ${\displaystyle 0\in T}$ since ${\displaystyle (0,a)\in g}$. Suppose ${\displaystyle n\in T}$. Then ${\displaystyle (n,z)\in g}$ for some ${\displaystyle z\in X}$. This gives ${\displaystyle (n+1,f(z))\in g}$. Hence ${\displaystyle n+1\in T}$. It follows by mathematical induction that ${\displaystyle T=\mathbb{N}}$.

Let ${\displaystyle U=\{x\in \mathbb{N}:\text{if }(x,y),(x,z)\in g\text{ then }y=z\}}$. Suppose for contradiction that ${\displaystyle 0\notin U}$. That is, suppose we have ${\displaystyle (0,z)}$, in addition, ${\displaystyle (0,a)\in g}$, where ${\displaystyle z\ne a}$. Then ${\displaystyle g\mathrm{\setminus }\{(0,z)\}\in S}$, contradicting the fact that g is the smallest element of S. Thus, ${\displaystyle 0\in U}$.

We show that if ${\displaystyle x\in U}$ then ${\displaystyle x+1\in U}$. Suppose this is not the case. Then ${\displaystyle \mathrm{\exists }m\in U}$ so that ${\displaystyle m+1\notin U}$. Since ${\displaystyle m\in U}$ and ${\displaystyle T=\mathbb{N}}$, there is a unique ${\displaystyle n\in \mathbb{N}}$ with ${\displaystyle (m,n)\in g}$. Then ${\displaystyle (m+1,f(n))\in g}$. Since ${\displaystyle m+1\notin U}$, there is an ${\displaystyle (m+1,z)\in g}$, in addition to ${\displaystyle (m+1,f(n))\in g}$, where ${\displaystyle z\ne f(n)}$. But then ${\displaystyle g\mathrm{\setminus }\{(m+1,z)\}\in S}$, contradicting the fact that g is the smallest element of S. The mathematical induction then says that ${\displaystyle U=\mathbb{N}}$. Therefore there exists a function whose graph is g. Denote it by F.

Proof of uniqueness

Take two functions ${\displaystyle F:\mathbb{N}\to X}$ and ${\displaystyle G:\mathbb{N}\to X}$ such that:

${\displaystyle F(0)=a}$

${\displaystyle G(0)=a}$

${\displaystyle F(n+1)=f(F(n))}$

${\displaystyle G(n+1)=f(G(n))}$

where a is an element of X.

It can be proved by mathematical induction that F(n) = G(n) for all natural numbers n:

Base Case: F(0) = a = G(0) so the equality holds for n = 0.

Inductive Step: Suppose F(k) = G(k) for some ${\displaystyle k\in \mathbb{N}}$. Then F(k + 1) = f(F(k)) = f(G(k)) = G(k + 1).

Hence F(k) = G(k) implies F(k + 1) = G(k + 1).

By induction, F(n) = G(n) for all ${\displaystyle n\in \mathbb{N}}$.

In computer science

A common method of simplification is to divide a problem into subproblems of the same type. As a computer programming technique, this is called divide and conquer and is key to the design of many important algorithms. Divide and conquer serves as a top-down approach to problem solving, where problems are solved by solving smaller and smaller instances. A contrary approach is dynamic programming. This approach serves as a bottom-up approach, where problems are solved by solving larger and larger instances, until the desired size is reached.

A classic example of recursion is the definition of the factorial function, given here in Python code:

<span id="mwAYA"></span><span class="k" id="mwAYE">def</span><span class="w" id="mwAYI"> </span><span class="nf" id="mwAYM">factorial</span><span class="p" id="mwAYQ">(</span><span class="n" id="mwAYU">n</span><span class="p" id="mwAYY">):</span> <span class="k" id="mwAYc">if</span> <span class="n" id="mwAYg">n</span> <span class="o" id="mwAYk">></span> <span class="mi" id="mwAYo">0</span><span class="p" id="mwAYs">:</span> <span class="k" id="mwAYw">return</span> <span class="n" id="mwAY0">n</span> <span class="o" id="mwAY4">*</span> <span class="n" id="mwAY8">factorial</span><span class="p" id="mwAZA">(</span><span class="n" id="mwAZE">n</span> <span class="o" id="mwAZI">-</span> <span class="mi" id="mwAZM">1</span><span class="p" id="mwAZQ">)</span> <span class="k" id="mwAZU">else</span><span class="p" id="mwAZY">:</span> <span class="k" id="mwAZc">return</span> <span class="mi" id="mwAZg">1</span>

The function calls itself recursively on a smaller version of the input (n - 1) and multiplies the result of the recursive call by n, until reaching the base case, analogously to the mathematical definition of factorial.

Recursion in computer programming is exemplified when a function is defined in terms of simpler, often smaller versions of itself. The solution to the problem is then devised by combining the solutions obtained from the simpler versions of the problem. One example application of recursion is in parsers for programming languages. The great advantage of recursion is that an infinite set of possible sentences, designs or other data can be defined, parsed or produced by a finite computer program.

Recurrence relations are equations which define one or more sequences recursively. Some specific kinds of recurrence relation can be "solved" to obtain a non-recursive definition (e.g., a closed-form expression).

Use of recursion in an algorithm has both advantages and disadvantages. The main advantage is usually the simplicity of instructions. The main disadvantage is that the memory usage of recursive algorithms may grow very quickly, rendering them impractical for larger instances.

In biology

Shapes that seem to have been created by recursive processes sometimes appear in plants and animals, such as in branching structures in which one large part branches out into two or more similar smaller parts. One example is Romanesco broccoli.

In business

Recursion is sometimes referred to in management science as the process of iterating through levels of abstraction in large business entities. A common example is the recursive nature of management hierarchies, ranging from line management to senior management via middle management. It also encompasses the larger issue of capital structure in corporate governance.

In art

The Matryoshka doll is a physical artistic example of the recursive concept.

Recursion has been used in paintings since Giotto's Stefaneschi Triptych, made in 1320. Its central panel contains the kneeling figure of Cardinal Stefaneschi, holding up the triptych itself as an offering. This practice is more generally known as the Droste effect, an example of the Mise en abyme technique.

M. C. Escher's Print Gallery (1956) is a print which depicts a distorted city containing a gallery which recursively contains the picture, and so ad infinitum.

In culture

The film Inception has colloquialized the appending of the suffix -ception to a noun to jokingly indicate the recursion of something.