Recursion 

Recursively Defined Functions

The canonical example of a recursively defined function is the following definition of the factorial function f(n):

f(0) = 1

f(n) = n · f(n-1)   for any natural number n > 0

Given this definition, also called a recurrence relation, we work out f(3) as follows:

 f(3) = 3 · f(3-1)
      = 3 · f(2)
      = 3 · 2 · f(2-1)
      = 3 · 2 · f(1) 
      = 3 · 2 · 1 · f(1-1)
      = 3 · 2 · 1 · f(0)
      = 3 · 2 · 1 · 1
      = 6

Another example is the definition of Fibonacci numbers.

Here is another, perhaps simpler way to understand recursive processes:

1. Are we done yet? If so, return the results. Without such a termination condition a recursion would go on forever.
2. If not, simplify the problem, solve those simpler problem(s) by sending them to 1., and assemble the results into a solution for the original problem. Then return that solution.

A common method of simplification is to divide the problem into subproblems of the same type. Such a programming technique is called divide and conquer and is key to the design of many important algorithms, as well as being a fundamental part of dynamic programming.

Virtually all programming languages in use today allow the direct specification of recursive functions and procedures. When such a function is called, the computer keeps track of the various instances of the function by using a stack. Conversely, every recursive function can be transformed into an iterative function by using a stack.

Any function that can be evaluated by a computer can be expressed in terms of recursive functions, without use of iteration.

Indeed, some languages designed for logic programming and functional programming provide recursion as the only means of repetition directly available to the programmer. Such languages generally make tail recursion as efficient as iteration, letting programmers express other repetition structures (such as Scheme's map and for) in terms of recursion.

Recursion is deeply embedded in the theory of computation, with the theoretical equivalence of recursive functions and Turing machines at the foundation of ideas about the universality of the modern computer.

John McCarthy's function, McCarthy's 91 is another example of a recursive function.

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 F : N -> X (where N denotes the set of natural numbers) such that

F(0) = a

F(n+1) = f(F(n))

Proof of Uniqueness

Take two functions f and g of domain N and codomain A such that:

f(0) = a

g(0) = a

f(n+1) = F(f(n))

g(n+1) = F(g(n))

where a is an element of A. We want to prove that f = g. Two functions are equal if they:

i. have equal domains/codomains;

ii. have the same graphic.

i. Done!

ii. Mathematical induction: for all n in N, f(n) = g(n)? (We shall call this condition, say, Eq(n)):

1.:Eq(0) iff f(0) = g(0) iff a = a. Done!

2.:Let n be an element of N. Assuming that Eq(n) holds, we want to show that Eq(n+1) holds as well, which is easy because: f(n+1) = F(f(n)) = F(g(n)) = g(n+1). Done!

Prove of Existence

Recursively Defined Sets

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

0 is in N

if n is in N, then n+1 is in N

The natural numbers can be defined as the smallest set satisfying these two properties.

Another interesting example is the set of all true propositions in an axiomatic system.

if a proposition is an axiom, it is true.

if a proposition can be obtained from true propositions by means of inference rules, it is true.

(It needs to be pointed out that determining whether a certain object is in a recursively defined set isn't an algorithmic task.)

List of recurrence relations or algorithms

• Factorial -- n! = n * (n - 1) * ... * 1
• Fibonacci numbers -- f(n) = f(n - 1) + f(n - 2)
• Catalan numbers[?] -- C(2n, n)/(n + 1)
• Computing compound interests
• The tower of Hanoi
• Ackermann's function[?]
• Population growth[?]

See also

• Self-reference
• Strange loop
• Primitive recursive function
• Recursive acronym
• Decidable language

Further Readings and References

I know he'll prove all right, and you see we never rules; the disgraceful theft of the letter; its destruction; the insignificance with the risk for her adored elder brother. Absolute convalescence had been peremptorily insisted upon by his physicians, his recovery, but threw him back. That the knowledge of Percy's and mother never occurred to her, and beyond words did she dread its few weeks since had been very hurtful to him, and now her chief appeal to her--a helpless girl.html">girl--to rescue him from the consequences suggestion--nay, almost demand--that she should ask.html">ask from their kind Seabrooke; the uncle who had opened his heart and home to them, whom approbation she looked more eagerly than she did for those of any would never ask him for such a thing, that honorable, high-minded, mean; "fussy," Percy had called him, about such matters. Nor did it occur to her that in his selfish desire to secure her aid, arrest and public disgrace, which would reflect.html">reflect upon the family. Poor little girl! In her inexperience and alarm she did not reflect though he should not be able to comply with Seabrooke's just demands; mind. Little wonder was it that she was perfectly overwhelmed, or return of her fever. Nor was Hannah less credulous. She magnified the danger for Percy as culprit himself. She had the means of relieving the boy's greater part of these in her master's care for investment, and she And, like Lena, she was afraid of exciting some inquiry or.

 On wordlookup.net  

All is still licensed under the GNU FDL.
It uses material from the wikipedia.