|
|
| Line 1: |
Line 1: |
| {{pp-vandalism|small=yes}}
| | It has turned into a sort of marketing method to incorporate gaming options into a website being a type of direct entertainment offer. In turn everything that can provide the benefit in predicting of online betting odds. Just Shut Up & Drive - the name says it all within this fast paced driving game. These kinds of games are freely accessible, easy to use and can trigger your strategic skills and imagination. I get chills contemplating matching up, on different racing surfaces and under different track conditions, thoroughbred horses which can be considered the most effective that ever lived. <br><br>drawn to Racing Games usually are today's youth because of their drive. You also can produce a reward for that first person to find everything around the list. It takes some getting utilized to, but after a while, even casual gamer should manage a few victories. You can decide your route of races, the season and also the difficulty levels. With the correct equipment and drivers, you'll be able to make use of your Sony PS3 Sixaxis controller on your PC (similarly for the XBOX 360 controller). <br><br>The handling in the original GRID was great, but an upgrade to a already good engine is not a bad thing, especially an element this crucial. 1 away from 5, 2,200 app users have taken some time to review this free app. He also trained the aforementioned Skimming, whose to back victories gave him an overall of six Pacific Classic wins within the first eleven runnings. Coming returning to the racing titles they've released you will get the portion of enjoying the game, it is possible to destroy as many objects inside game, including your vehicle, and you can still win. Innovations purchased up within the latest and well-liked gaming consoles allow the ball player accomplish tricks which could be deified through the guidelines of physics without having the hazards of injuries and fractures. <br><br>It is but natural to attempt your hand at as numerous as you'll be able to grab. Finally I purchased the [https://spidermanunlimitedcheats.wordpress.com/ spider-man unlimited hack 2014] CD Cassette of those games. There is wide various alternatives for you from which to choose. However, in the event you play truck car games on a regular basis, you'll be able to get on the last level of the games and take care of and even buy your name about the hall of fame of these super car games. So these games required to maintain the auto on course free of deviating from a normal track. <br><br>You could also go with a different skin on your car or perhaps use a photo inside your scrapbook to pay your automobile. However, it requires large amount of gaming skills to perfect in this type of competitive online world. Visiting these sections can assist you locate the right game which suits your taste. Dirt 3 Nothing safer to satisfy and quench the off road thirst of most rallying fans out there. For its i - Pad version, Need for Speed Shift has some exclusive features including 8 exclusive cars, stunning HD graphics, physics-based acceleration, and ultra-responsive manual controls. |
| {{Other uses}}
| |
| <!-- Making the Recursion article link to itself will not display correctly, and is considered to break [[WP:ASTONISH]]. The joke itself is already featured in the "Recursive humor" section. See discussion on the talk page. -->
| |
| {{Refimprove|date=June 2012}}
| |
| [[Image:Droste.jpg|thumb|A visual form of recursion known as the ''[[Droste effect]]''. The woman in this image holds an object that contains a smaller image of her holding an identical object, which in turn contains a smaller image of herself holding an identical object, and so forth.]]
| |
| '''Recursion''' is the process of repeating items in a [[Self-similarity|self-similar]] way. For instance, when the surfaces of two mirrors are exactly parallel with each other the nested images that occur are a form of infinite recursion. The term has a variety of meanings specific to a variety of disciplines ranging from [[linguistics]] to [[logic]]. The most common application of recursion is in [[mathematics]] and [[computer science]], in which it refers to a method of defining [[function (mathematics)|functions]] in which the function being defined is applied within its own definition. Specifically this defines an infinite number of instances (function values), using a finite expression that for some instances may refer to other instances, but in such a way that no loop or infinite chain of references can occur. The term is also used more generally to describe a process of repeating objects in a self-similar way.
| |
| | |
| ==Formal definitions of recursion==
| |
| [[File:Screenshot Recursion via vlc.png|thumb|Recursion in a screen recording program, where the smaller window contains a snapshot of the entire screen.]]
| |
| In [[mathematics]] and [[computer science]], a class of objects or methods exhibit recursive behavior when they can be defined by two properties:
| |
| | |
| # A simple base case (or cases)
| |
| # A set of rules that reduce all other cases toward the base case
| |
| | |
| For example, the following is a recursive definition of a person's ancestors:
| |
| *One's [[parent]]s are one's [[ancestor]]s (''base case'').
| |
| *The ancestors of one's ancestors are also one's ancestors (''recursion step'').
| |
| | |
| The [[Fibonacci sequence]] is a classic example of recursion:
| |
| | |
| <math>\text{Fib}(0)=0\text{ as base case 1,}</math> | |
| | |
| <math>\text{Fib}(1)=1\text{ as base case 2,}</math>
| |
| | |
| <math>\text{For all integers }n>1,~\text{ Fib}(n):=\text{Fib}(n-1) + \text{Fib}(n-2).</math>
| |
| | |
| Many mathematical axioms are based upon recursive rules. For example, the formal definition of the [[natural number]]s by the [[Peano axioms]] can be described as: ''0 is a natural number, and each natural number has a successor, which is also a natural number.'' By this base case and recursive rule, one can generate the set of all natural numbers.
| |
| | |
| Recursively defined mathematical objects include [[function (mathematics)|function]]s, [[set (mathematics)|sets]], and especially [[fractal]]s.
| |
| | |
| There are various more tongue-in-cheek "definitions" of recursion; see [[#Recursive humor|recursive humor]].
| |
| | |
| ==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. The running of a procedure involves actually following the rules and performing the steps. An analogy: a procedure is like a written recipe; running a procedure is like actually preparing the meal.
| |
| | |
| Recursion is related to, but not the same as, a reference within the specification of a procedure to the execution of some other procedure. For instance, a recipe might refer to cooking vegetables, which is another procedure that in turn requires heating water, and so forth. However, a recursive procedure is where (at least) one of its steps calls for a new instance of the very same procedure, like a [[sourdough]] recipe calling for some dough left over from the last time the same recipe was made. This of course 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, like a sourdough recipe that also tells you how to get some starter dough in case you've never made it before. Even if 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 of how far various simultaneous instances of the procedures have progressed. For this reason recursive definitions are very rare in everyday situations. An example could be the following procedure to find a way through a [[maze]]. Proceed forward until reaching either an exit or a branching point (a dead end is considered a branching point with 0 branches). If the point reached is an exit, terminate. Otherwise try each branch in turn, using the procedure recursively; if every trial fails by reaching only dead ends, return on the path that led to this branching point and report failure. Whether this actually defines a terminating procedure depends on the nature of the maze: it must not allow loops. In any case, executing the procedure requires carefully recording all currently explored branching points, and which of their branches have already been exhaustively tried.
| |
| | |
| ==Recursion in language==
| |
| Linguist [[Noam Chomsky]] theorizes that unlimited extension of any [[natural language]] is possible using the recursive device of embedding clauses within sentences (Aspects of the Theory of Syntax. 1965). For example, two simple sentences—''"Dorothy met the Wicked Witch of the West in Munchkin Land"'' and ''"The Wicked Witch's sister was killed in Munchkin Land"''—can be embedded in a third sentence, ''"Dorothy liquidated the Wicked Witch with a pail of water,"'' to obtain a recursive sentence: ''"Dorothy, who met the Wicked Witch of the West in Munchkin Land where her sister was killed, liquidated her with a pail of water."''
| |
| | |
| The idea that recursion is an essential property of human language (as Chomsky suggests) is challenged by [[linguistics|linguist]] [[Daniel Everett]] in his work ''Cultural Constraints on Grammar and Cognition in Pirahã: Another Look at the Design Features of Human Language'', in which he hypothesizes that cultural factors made recursion unnecessary in the development of the [[Pirahã language]]. This concept, which challenges Chomsky's idea that recursion is the only trait that differentiates human and animal communication, is currently under debate.
| |
| Andrew Nevins, David Pesetsky and Cilene Rodrigues provide a debate against this proposal.<ref>{{cite journal | doi = 10.1353/lan.0.0140 | title = Evidence and argumentation: A reply to Everett (2009) |url=http://web.mit.edu/linguistics/people/faculty/pesetsky/Nevins_Pesetsky_Rodrigues_2_Evidence_and_Argumentation_Reply_to_Everett.pdf | format=PDF| year = 2009 | last1 = Nevins | first1=Andrew | last2 = Pesetsky | first2=David | last3 = Rodrigues | first3=Cilene | journal = Language | volume = 85 | issue = 3 | pages = 671–681 }}</ref> Everett, however, does not minimize the importance of recursion in thought or information processing, but rather tries to flip Chomsky's argument around, contending that recursion can selectively go from thought to languages, rather than language to thought. He states that recursive structures are fundamental to information processing (quoting [[Herbert Simon]]), and then says: "If you go back to the Piraha language, and you look at the stories they tell, you do find recursion. You find that ideas are built inside of other ideas..." (2013, ''Thinking'', John Brockman ed., p. 273). This quote is after the Nevins, Pesetsky, Rodrigues responses. In other words, recursion is acknowledged by all parties in the debate as central to thought, information processing, perhaps consciousness itself (in robotics recursion is a proxy for self-awareness in many designs), and either as cause or effect in many grammars, whether genetic or not.
| |
| | |
| Recursion in linguistics enables 'discrete infinity' by embedding phrases within phrases of the same type in a hierarchical structure. Without recursion, language does not have 'discrete infinity' and cannot embed sentences into infinity (with a '[[Matryoshka doll|Russian nesting doll]]' effect). Everett contests that language must have discrete infinity, and asserts that the Pirahã language—which he claims lacks recursion—is in fact finite. He likens it to the finite game of [[chess]], which has a finite number of moves but is nevertheless very productive, with novel moves being discovered throughout history.
| |
| | |
| ===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''.<ref name=Hunter>{{cite book|last=Hunter|first=David|title=Essentials of Discrete Mathematics|year=2011|publisher=Jones and Bartlett|pages=494|url=http://books.google.com/books?id=kuwhTxCVovQC&dq=recursion+joke&source=gbs_navlinks_s}}</ref>
| |
| | |
| A variation is found on page 269 in the [[Back-of-the-book index|index]] of some editions of Kernighan and Ritchie's book ''[[The C Programming Language (book)|The C Programming Language]]''; the index entry recursively references itself ("recursion 86, 139, 141, 182, 202, 269"). The earliest version of this joke was in "Software Tools" by Kernighan and Plauger, and also appears in "The UNIX Programming Environment" by Kernighan and Pike. It did not appear in the first edition of ''The C Programming Language''.
| |
| | |
| Another joke is that "To understand recursion, you must understand recursion."<ref name=Hunter/> 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 acronym]]s can also be examples of recursive humor. [[PHP]], for example, stands for "PHP Hypertext Preprocessor", [[Wine (software)|WINE]] stands for "Wine Is Not an Emulator." and [[GNU Project|GNU]] stands for "GNU's not Unix".
| |
| | |
| ==Recursion in mathematics==
| |
| [[File:Sierpinski triangle.svg|right|thumb|250px|A [[Sierpinski triangle]]—a confined recursion of triangles to form a geometric [[lattice (group)|lattice]]]]
| |
| | |
| ===Recursively defined sets===
| |
| {{Main|Recursive definition}}
| |
| | |
| ====Example: the natural numbers====
| |
| {{see also|Closure (mathematics)}}
| |
| The canonical example of a recursively defined set is given by the [[natural numbers]]:
| |
| | |
| :0 is in <math>\mathbb{N}</math>
| |
| :if ''n'' is in <math>\mathbb{N}</math>, then ''n'' + 1 is in <math>\mathbb{N}</math>
| |
| :The set of natural numbers is the smallest set satisfying the previous two properties.
| |
| | |
| ====Example: The set of true reachable propositions====
| |
| Another interesting example is the set of all "true reachable" propositions in an [[axiomatic system]].
| |
| | |
| *if a proposition is an axiom, it is a true reachable proposition.
| |
| *if a proposition can be obtained from true reachable propositions by means of inference rules, it is a true reachable proposition.
| |
| *The set of true reachable propositions is the smallest set of propositions satisfying these conditions.
| |
| | |
| This set is called 'true reachable propositions' because in non-constructive approaches to the foundations of mathematics, the set of true propositions may be larger than the set recursively constructed from the axioms and rules of inference. See also [[Gödel's incompleteness theorems]].
| |
| | |
| ===Finite subdivision rules===
| |
| {{Main|Finite subdivision rule}}
| |
| 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 (mathematics)|function]] may be partly 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 lead to non-recursively defined values, in this case ''F''(0) = 0 and ''F''(1) = 1.
| |
| | |
| A famous recursive function is the [[Ackermann function]], which—unlike the Fibonacci sequence—cannot easily be expressed without recursion.
| |
| | |
| ===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 (mathematics)|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).
| |
| | |
| ==Recursion in computer science==
| |
| {{Main|Recursion (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 algorithm|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 C code:
| |
| | |
| <source lang="c">unsigned int factorial(unsigned int n) { | |
| if (n == 0) {
| |
| return 1;
| |
| } else {
| |
| return n * factorial(n - 1);
| |
| }
| |
| }</source>
| |
| | |
| 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 [[parser]]s 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 relation]]s are equations to define one or more sequences recursively. Some specific kinds of recurrence relation can be "solved" to obtain a non-recursive definition.
| |
| | |
| Use of recursion in an algorithm has both advantages and disadvantages. The main advantage is usually simplicity. The main disadvantage is often that the algorithm may require large amounts of memory if the depth of the recursion is very large.
| |
| | |
| ==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 <math>f: X \rightarrow X</math>, the theorem states that there is a unique function <math>F: \mathbb{N} \rightarrow X</math> (where <math>\mathbb{N}</math> denotes the set of natural numbers including zero) such that
| |
| :<math>F(0) = a</math>
| |
| :<math>F(n + 1) = f(F(n))</math>
| |
| for any natural number ''n''.
| |
| | |
| ===Proof of uniqueness===
| |
| Take two functions <math>F: \mathbb{N} \rightarrow X</math> and <math>G: \mathbb{N} \rightarrow X</math> such that:
| |
| | |
| :<math>F(0) = a</math>
| |
| :<math>G(0) = a</math>
| |
| :<math>F(n + 1) = f(F(n))</math>
| |
| :<math>G(n + 1) = f(G(n))</math>
| |
| | |
| where ''a'' is an element of ''X''.
| |
| | |
| It can be proved by [[mathematical induction]] that <math>F(n) = G(n)</math> for all natural numbers ''n'':
| |
| | |
| :'''Base Case''': <math>F(0) = a = G(0)</math> so the equality holds for <math>n = 0</math>.
| |
| | |
| :'''Inductive Step''': Suppose <math>F(k) = G(k)</math> for some <math>k \in \mathbb{N}</math>. Then <math>F(k+1) = f(F(k)) = f(G(k)) = G(k+1).</math>
| |
| ::Hence F(k) = G(k) implies F(k+1) = G(k+1).
| |
| | |
| By Induction, <math>F(n) = G(n)</math> for all <math>n \in \mathbb{N}</math>.
| |
| | |
| ===Examples===
| |
| Some common recurrence relations are:
| |
| {{col-begin}}
| |
| {{col-break}}
| |
| *[[Golden Ratio]]: <math>\phi = 1 + (1/\phi) = 1 + (1/(1 + (1/(1 + 1/...))))</math>
| |
| *[[Factorial]]: <math>n! = n (n - 1)! = n (n - 1)\cdots 1</math>
| |
| *[[Fibonacci numbers]]: <math>f (n) = f (n - 1) + f (n - 2)</math>
| |
| *[[Catalan number]]s: <math>C_0=1</math>, <math>C_{n+1} = (4n+2)C_n/(n+2)</math>
| |
| *Computing compound [[interest]]
| |
| *The [[Tower of Hanoi]]
| |
| *[[Ackermann function]]
| |
| {{col-end}}
| |
| | |
| ==Bibliography==
| |
| * {{cite journal|first=Edsger W.|last=Dijkstra|authorlink=Edsger W. Dijkstra|title=Recursive Programming|journal=Numerische Mathematik|volume=2|issue=1|year=1960|pages=312–318|doi=10.1007/BF01386232}}
| |
| *{{cite book | author=Johnsonbaugh, Richard | title=Discrete Mathematics | publisher=Prentice Hall | year=2004 | isbn=0-13-117686-2 }}
| |
| *{{cite book | author=Hofstadter, Douglas | title=Gödel, Escher, Bach: an Eternal Golden Braid | publisher=Basic Books | year=1999 | isbn=0-465-02656-7 }}
| |
| *{{cite book | author=Shoenfield, Joseph R. | title=Recursion Theory | publisher=A K Peters Ltd | year=2000 | isbn=1-56881-149-7 }}
| |
| *{{cite book | author=Causey, Robert L. | title=Logic, Sets, and Recursion | publisher=Jones & Bartlett | year=2001 | isbn=0-7637-1695-2 }}
| |
| *{{cite book | author=Cori, Rene; Lascar, Daniel; Pelletier, Donald H. | title=Recursion Theory, Gödel's Theorems, Set Theory, Model Theory | publisher=Oxford University Press | year=2001 | isbn=0-19-850050-5 }}
| |
| *{{cite book | author=Barwise, Jon; Moss, Lawrence S. | title=Vicious Circles | publisher=Stanford Univ Center for the Study of Language and Information | year=1996 | isbn=0-19-850050-5 }} - offers a treatment of [[corecursion]].
| |
| *{{cite book | author=Rosen, Kenneth H. | title=Discrete Mathematics and Its Applications | publisher=McGraw-Hill College | year=2002 | isbn=0-07-293033-0 }}
| |
| *{{cite book | author=Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, Clifford Stein | title=Introduction to Algorithms | publisher=Mit Pr | year=2001 | isbn=0-262-03293-7 }}
| |
| *{{cite book | author = Kernighan, B.; Ritchie, D. | title=The C programming Language | publisher=Prentice Hall | year = 1988 | isbn = 0-13-110362-8 }}
| |
| *{{cite book | author=Stokey, Nancy,; Robert Lucas; Edward Prescott | title=Recursive Methods in Economic Dynamics | publisher=Harvard University Press | year=1989 | isbn=0-674-75096-9}}
| |
| *{{cite book | author=Hungerford |title=Algebra | publisher=Springer|year=1980|isbn=978-0-387-90518-1}}, first chapter on set theory.
| |
| | |
| ==See also==
| |
| <div style="-moz-column-count:3; column-count:3;">
| |
| * [[Corecursion]]
| |
| * [[Course-of-values recursion]]
| |
| * [[Digital infinity]]
| |
| * [[Fixed point combinator]]
| |
| * [[Infinite loop]]
| |
| * [[Infinitism]]
| |
| * [[Iterated function]]
| |
| * [[Mise en abyme]]
| |
| <!--
| |
| Including [[Recursion]] in this list will not display correctly, and
| |
| is considered to break [[WP:ASTONISH]]. See discussion on the talk page.
| |
| -->
| |
| * [[Reentrant (subroutine)]]
| |
| * [[Self-reference]]
| |
| * [[Strange loop]]
| |
| * [[Tail recursion]]
| |
| * [[Tupper's self-referential formula]]
| |
| * [[Turtles all the way down]]
| |
| </div>
| |
| | |
| ==References==
| |
| <references/>
| |
| | |
| ==External links==
| |
| {{Wiktionary|recursion|recursivity}}
| |
| * [http://www.freenetpages.co.uk/hp/alan.gauld/tutrecur.htm Recursion] - tutorial by Alan Gauld
| |
| * [http://amitksaha.files.wordpress.com/2009/05/recursion-primer.pdf A Primer on Recursion]- contains pointers to recursion in Formal Languages, Linguistics, Math and Computer Science
| |
| * [http://research.swtch.com/2010/03/zip-files-all-way-down.html Zip Files All The Way Down]
| |
| *[http://www.ucl.ac.uk/psychlangsci/staff/linguistics-staff/nevins-publications/npr09b Nevins, Andrew and David Pesetsky and Cilene Rodrigues. Evidence and Argumentation: A Reply to Everett (2009). Language 85.3: 671--681 (2009)]
| |
| | |
| {{Fractals}}
| |
| {{logic}}
| |
| | |
| [[Category:Mathematical logic]]
| |
| [[Category:Theory of computation]]
| |
| [[Category:Programming idioms]]
| |
| [[Category:Recursion| ]]
| |
| [[Category:Self-reference]]
| |