Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In computability theory, computable functions are also called recursive functions. At least at first sight, they do not have anything in common with what you call "recursive" in day-to-day programming (i.e., functions that call themselfes).

What is the actual meaning of recursive in the context of computability? Why are those functions called "recursive"?

To put it in other words: What is the connection between the two meanings of "recursiveness"?

share|cite|improve this question
2  
μ-recursive function – Thomas Klimpel Jan 12 at 21:02
2  
They cheat, because they include the μ operator. This is a minimization operator, but of course minimization has very little to do with recursion. So it seem like somebody (Kleene) thought that "recursive" would sound nice, so he invented an excuse for using that name. Much later, Robert Soare explained that "computable" would sound much better, and that "recursive" had just been a marketing trick of the early days, and everybody agreed. – Thomas Klimpel Jan 12 at 21:50
3  
Waht about primitive recursive functions? Copied from wikipedia they are defined as $h(0,x_{1},\ldots ,x_{k})=f(x_{1},\ldots ,x_{k})$ and $h(S(y),x_{1},\ldots ,x_{k})=g(y,h(y,x_{1},\ldots ,x_{k}),x_{1},\ldots ,x_{k})$. That is a function that calls itself. – Hendrik Jan Jan 12 at 22:53
3  
@GoloRoden Note that the tag-description of 'computability' (you used it for this question) says: "computability theory a.k.a. recursion theory". Gödel termed functions recursive, but the term evolved to computable. Probably to avoid confusions like yours. People who study computability theory (intensively) tend to use the term recursion theory more as to 'respect' its roots. – Auberon Jan 13 at 1:38
1  
because theyr are defined recursively, i.e "more complex functions are defined in terms of previously defined, simpler functions" – Nikos M. Jan 13 at 23:23
up vote 10 down vote accepted

Define some basic functions:

  • zero function

    $$ zero: \mathbb{N} \rightarrow \mathbb{N} : x \mapsto 0 $$

  • successor function

    $$ succ: \mathbb{N} \rightarrow \mathbb{N} : x \mapsto x + 1 $$

  • projection function

$$p_i^n: \mathbb{N}^n \rightarrow \mathbb{N} : (x_1, x_2, \dots, x_n) \mapsto x_i $$

From now on I will use $\bar{x_n}$ to denote $(x_1, x_2, \dots, x_n)$

Define a composition:

Given functions

  • $g_1, g_2, \dots, g_m$ each with signature $\mathbb{N}^k \rightarrow \mathbb{N}$
  • $f : \mathbb{N}^m \rightarrow \mathbb{N}$

Construct the following function:

\begin{align} h: \mathbb{N}^k \rightarrow \mathbb{N}: \bar{x_k} \mapsto h(\bar{x_k}) = f ( & g_1(\bar{x_k}), g_2(\bar{x_k}), \dots, g_m(\bar{x_k}) ) \end{align}

Define primitive recursion:

Given functions

  • $ f: \mathbb{N}^k \rightarrow \mathbb{N} $
  • $ g: \mathbb{N}^{k+2} \rightarrow \mathbb{N} $

Construct the following (piecewise) function:

$$ h : \mathbb{N}^{k+1} \rightarrow \mathbb{N} : \\ (\bar{x_k}, y + 1) \mapsto \begin{cases} f(\bar{x_k}), & y + 1 = 0 \\ g (\bar{x_k}, y, h(\bar{x_k}, y)), & y + 1 > 0 \end{cases} $$


All functions that can be made using compositions and primitive recursion on basic functions, are called primitive recursive. It is called that way by definition. While a link with functions that call themselves exists, there's no need to try and link them with each other. You might consider recursion a homonym.

This definition and construction above was constructed by Gödel (a few other people were involved too) in an attempt to capture all functions that are computable i.e. there exists a Turing Machine for that function. Note that the concept of a Turing Machine was not yet described, or it was at least very vague.

(Un)fortunately, someone called Ackermann came along and defined the following function:

  • $Ack : \mathbb{N}^2 \rightarrow \mathbb{N}$
  • $Ack(0, y) = y+1$
  • $Ack(x+1, 0) = Ack(x, 1)$
  • $Ack(x+1, y+1) = Ack(x, Ack(x+1,y))$

This function is computable, but there's no way to construct it using only the constructions above! (i.e. $Ack$ is not primitive recursive) This means that Gödel and his posse failed to capture all computable functions in their construction!

Gödel had to expand his class of functions so $Ack$ could be constructed. He did this by defining the following:

Unbounded minimisation

  • $g : \mathbb{N}^k \rightarrow \mathbb{N}$
  • IF $\left[f(\bar{x_k}, y) = 0 \text{ AND } \\f(\bar{x_k}, z) \text{ is defined } \forall z < y \text{ AND } \\f(\bar{x_k}, z)\neq 0\right]$
    THEN
    $g(\bar{x_k}) = y$
    ELSE
    $g(\bar{x_k})$ is not defined.

This last one may be hard to grasp, but it basically means that $g((x_1, x_2, \dots, x_k))$ is the smallest root of $f$ (if a root exists).


All functions that can be constructed with all the constructions defined above are called recursive. Again, the name recursive is just by definition, and it doesn't necessarily have correlation with functions that call themselves. Truly, consider it a homonym.

Recursive functions can be either partial recursive functions or total recursive functions. All partial recursive functions are total recursive functions. All primitive recursive functions are total. As an example of a partial recursive function that is not total, consider the minimisation of the successor function. The successor function doesn't have roots, so its minimisation is not defined. An example of a total recursive function (which uses minimisation) is $Ack$.

Now Gödel was able to construct the $Ack$ function as well with his expanded class of functions. As a matter of fact, every function that can be computed by a Turing machine, can be represented by using the constructions above and vice versa, every construction can be represented by a Turing machine.

If you're intrigued, you could try to make Gödel's class bigger. You can try to define the 'opposite' of unbounded minimisation. That is, unbounded maximisation i.e. the function that finds the biggest root. However, you may find that computing that function is hard (impossible). You can read into the Busy Beaver Problem, which tries to apply unbounded maximisation.

share|cite|improve this answer
3  
I know realise the given definitions don't really answer the question, but my answer describes the evolution of recursion/computability theory, kind of. Might be worth a read. – Auberon Jan 13 at 1:46
    
I like it, thanks for your efforts :-) – Golo Roden Jan 13 at 4:58
    
In "if $h((x_1, x_2, ..., x_k), 0) = f((x_1, x_2, ..., x_k))$", I think you mean $h((x_1, x_2, ..., x_k, 0))$. Also, there is no then clause prior to the next bullet point's else clause. – Eric Towers Jan 13 at 5:22
2  
Afaik, this is subtly wrong. The set if $\mu$-recursive functions is called the set of partially recursive functions whereas recursive functions are always total. That's why the set of all total functions (resp. languages that can be decided) is called R. – Raphael Jan 13 at 7:08
1  
There are quite a few incorrect statements in your answer. You should not make up history for an answer. – Kaveh Jan 13 at 19:49

The founders of computability theory were mathematicians. They founded what is now called computability theory before there was any computers. What was the way mathematicians defined functions that could be computed? By recursive definitions!

So there were recursive function before there were any other model of computation like Turing machines or lambda calculus or register machines. So people referred to these function as recursive functions. The fact that they turned out to be exactly what Turing machines and other models can compute is a later event (mostly proven by Kleene).

We have the simple definition of a recursive function which is now called primitive recursive function. There were not general enough (e.g. Ackermann's function) so people developed more general notions like $\mu$-recursive functions and Herbrand-Gödel general recursive functions that did capture all computable functions (assuming the Church's thesis). Church claimed that his model of lambda calculus captured all computable functions. Many people, and in particular Gödel, were not convinced that these capture all functions that can be computed. Until Turing's analysis of computation and introduction of his machine model.

The name of the field used to recursion theory. However there has been a successful push in recent decades to change the name to something more appealing from recursion theory to something more computer sciency (vs. mathy). As a result the field is now called computability theory. However if you look at books, papers, conferences, etc. in the early decades they are called recursion theory and not computability theory. Even the title of Soare's own 1987 book (who was the main person behind the push to change the name to computability theory) is "Recursively Enumerable Sets and Degrees".

If you want to know more about the history a fun and good place to read about it is the first chapter of Classical Recursion Theory by Odifreddi.

share|cite|improve this answer

Robert Soare wrote an essay about this issue. According to him, the term (general) recursive functions was coined by Gödel, who defined them using some sort of mutual recursion. The name stuck, though later on other equivalent definitions were found.

For more information, I recommend Soare's essay.

share|cite|improve this answer

instead of putting a long comment decided to add an answer:

Because they are defined recursively, i.e "more complex functions are defined in terms of previously defined, simpler functions"

This kind of iterative or incremental procedure creates well-defined functions (in the mathematical sense)

This is the meaning of recursiveness in mathematical parlance. See below how this relates to recursion in programming parlance.

Compare this procedure with techniques and methods like (mathematical) induction which is also an example of recursiveness in mathematics.

Programming has a mathematical vein as well as an engineering one.

This (usualy constructive) procedure is also refered as "bootstrapping" in Operating Systems parlance.

However a runtime recursion of the same function (i.e caling itself during its runtime), since it must (hmm, should) happen on already computed values (or arguments), or in other words, in the part of the result set already computed, is also recursive in the above sense, i.e "defined w.r.t previously defined functions (and their values)"

Else is not well-defined, and leads to such things like Stack Overflow :))))

To give a further example from Operating Systems, a runtime recursion (calling itself) can be taken as the analog of an operating system rebooting after a certain update (e.g core update). Many OSes do the following procedure:

  1. an initial boot to load low-level routines (e.g I/O)
  2. do the necessary updates (using the low-level routines)
  3. re-boot (effectively, re-calling itself), but this time loading the more complex routines (or even the whole system)

Auberon's beautiful answer demonstrates a procedure of this kind in more detail.

share|cite|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.