Content deleted Content added
m →Recursive functions: comment out link to recursive function, which is not a main article |
m →Recursive algorithms: edit link |
||
Line 11:
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 programming language|Scheme's]] <code>map</code> and <code>for</code>) in terms of recursion.
Recursion is deeply embedded in the [[theory of computation]], with the theoretical equivalence of [[mu-recursive function]]s and [[Turing machine]]s at the foundation of ideas about the universality of the modern computer.
[[John McCarthy (computer scientist)|John McCarthy]]'s [[McCarthy 91 function|91 function]] is another example of a recursively defined function.
| |||