Recursion (computer science) - Revision history

Karl Jones: /* See also */

2016-09-15T20:14:22Z

‎See also

Karl Jones at 20:13, 15 September 2016

2016-09-15T20:13:45Z

Karl Jones at 19:59, 15 September 2016

2016-09-15T19:59:51Z

Karl Jones at 19:59, 15 September 2016

2016-09-15T19:59:16Z

Karl Jones: Created page with "In computer science, '''recursion''' is a method where the solution to a problem depends on solutions to smaller instances of the same problem (as opposed to iteration)...."

2016-09-15T19:50:51Z

Created page with "In computer science, '''recursion''' is a method where the solution to a problem depends on solutions to smaller instances of the same problem (as opposed to iteration)...."

New page

In [[computer science]], '''recursion''' is a method where the solution to a problem depends on solutions to smaller instances of the same problem (as opposed to iteration).

The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science.

== Description ==

"The power of recursion evidently lies in the possibility of defining an infinite set of objects by a finite statement. In the same manner, an infinite number of computations can be described by a finite recursive program, even if this program contains no explicit repetitions."

Most computer programming languages support recursion by allowing a function to call itself within the program text. Some functional programming languages do not define any looping constructs but rely solely on recursion to repeatedly call code.

[[Computability theory]] proves that these recursive-only languages are [[Turing completeness|Turing complete]]; they are as computationally powerful as Turing complete imperative languages, meaning they can solve the same kinds of problems as imperative languages even without iterative control structures such as “while” and “for”.

== See also ==

== External links ==

* [] @ Wikipedia.org

[[Category:]]
[[Category:]]

[[Category:Art]]
[[Category:Artificial intelligence]]
[[Category:Computer programming]]
[[Category:Computer science]]
[[Category:Computing]]
[[Category:Games]]
[[Category:Logic]]
[[Category:Mathematics]]

@@ Line 20: / Line 20: @@
 * [[Recursion]]
 * [[Sierpiński curve]]
 === Recursive functions ===

@@ Line 7: / Line 7: @@
 "The power of recursion evidently lies in the possibility of defining an infinite set of objects by a finite statement. In the same manner, an infinite number of computations can be described by a finite recursive program, even if this program contains no explicit repetitions."
-Most computer programming languages support recursion by allowing a [[Function (computer science)|function]] to call itself within the program text. Some [[Functional programming|functional programming languages]] do not define any looping constructs but rely solely on recursion to repeatedly call code.
+Most computer programming languages support recursion by allowing a [[Function (programming)|function]] to call itself within the program text. Some [[Functional programming|functional programming languages]] do not define any looping constructs but rely solely on recursion to repeatedly call code.
 [[Computability theory]] proves that these recursive-only languages are [[Turing completeness|Turing complete]]; they are as computationally powerful as Turing complete imperative languages, meaning they can solve the same kinds of problems as imperative languages even without iterative control structures such as “while” and “for”.

@@ Line 13: / Line 13: @@
 == See also ==
 * [[Functional programming]]
 * [[Hierarchical and recursive queries in SQL]]
@@ Line 29: / Line 30: @@
 == External links ==
-* [] @ Wikipedia.org
+* [https://en.wikipedia.org/wiki/Recursion_(computer_science) Recursion (computer science)] @ Wikipedia.org
 [[Category:Computer programming]]
 [[Category:Computer science]]
 [[Category:Computing]]
 [[Category:Mathematics]]