Array ( [0] => {{Short description|Process of repeating items in a self-similar way}} [1] => {{Other uses}} [2] => {{pp-vandalism|small=yes}} [3] => [4] => [5] => [[File:Droste Cacao Alcalinise blikje, foto4.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. 1904 Droste [[hot chocolate|cocoa]] tin, designed by Jan Misset]] [6] => [7] => '''Recursion''' occurs when the definition of a concept or process depends on a simpler or previous version of itself.{{Cite book |last=Causey |first=Robert L. |url=https://www.worldcat.org/oclc/62093042 |title=Logic, sets, and recursion |date=2006 |publisher=Jones and Bartlett Publishers |isbn=0-7637-3784-4 |edition=2nd|location=Sudbury, Mass. |oclc=62093042}} Recursion is used in a variety of disciplines ranging from [[linguistics]] to [[logic]]. The most common application of recursion is in [[mathematics]] and [[computer science]], where a [[function (mathematics)|function]] being defined is applied within its own definition. While this apparently defines an infinite number of instances (function values), it is often done in such a way that no infinite loop or infinite chain of references can occur. [8] => [9] => A process that exhibits recursion is ''recursive''. [10] => [11] => ==Formal definitions== [12] => [[File:Serpiente alquimica.jpg|thumb|[[Ouroboros]], an ancient symbol depicting a serpent or dragon eating its own tail]] [13] => In mathematics and computer science, a class of objects or methods exhibits recursive behavior when it can be defined by two properties: [14] => * {{anchor|base case}}A simple ''base case'' (or cases) — a terminating scenario that does not use recursion to produce an answer [15] => * {{anchor|recursive step}}A ''recursive step'' — a set of rules that reduces all successive cases toward the base case. [16] => [17] => For example, the following is a recursive definition of a person's ''ancestor''. One's ancestor is either: [18] => *One's parent (''base case''), ''or'' [19] => *One's parent's ancestor (''recursive step''). [20] => [21] => The [[Fibonacci sequence]] is another classic example of recursion: [22] => [23] => :{{math|1=Fib(0) = 0}} as base case 1, [24] => [25] => :{{math|1=Fib(1) = 1}} as base case 2, [26] => [27] => :For all [[integer]]s {{math|''n'' > 1}}, {{math|1=Fib(''n'') = Fib(''n'' − 1) + Fib(''n'' − 2)}}. [28] => [29] => 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: "Zero is a natural number, and each natural number has a successor, which is also a natural number."{{Cite web|url=https://www.britannica.com/science/Peano-axioms|title=Peano axioms {{!}} mathematics|website=Encyclopedia Britannica|language=en|access-date=2019-10-24}} By this base case and recursive rule, one can generate the set of all natural numbers. [30] => [31] => Other recursively defined mathematical objects include [[factorial]]s, [[function (mathematics)|function]]s (e.g., [[recurrence relation]]s), [[set (mathematics)|sets]] (e.g., [[Cantor ternary set]]), and [[fractal]]s. [32] => [33] => There are various more tongue-in-cheek definitions of recursion; see [[#Recursive humor|recursive humor]]. [34] => [35] => ==Informal definition== [36] => [[File:Sourdough.jpg|thumb|Recently refreshed [[sourdough]], bubbling through [[fermentation]]: the recipe calls for some sourdough left over from the last time the same recipe was made.]] [37] => [38] => 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'.{{Cite web|url=https://www.merriam-webster.com/dictionary/recursive|title=Definition of RECURSIVE|website=www.merriam-webster.com|language=en|access-date=2019-10-24}} [39] => [40] => 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, while the running of a procedure involves actually following the rules and performing the steps. [41] => [42] => Recursion is related to, but not the same as, a reference within the specification of a procedure to the execution of some other procedure. [43] => [44] => When a procedure is thus defined, this 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. [45] => [46] => Even if it is 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 as to how far various simultaneous instances of the procedures have progressed. For this reason, recursive definitions are very rare in everyday situations. [47] => [48] => ==In language== [49] => Linguist [[Noam Chomsky]], among many others, has argued that the lack of an upper bound on the number of grammatical sentences in a language, and the lack of an upper bound on grammatical sentence length (beyond practical constraints such as the time available to utter one), can be explained as the consequence of recursion in natural language.{{cite book|last=Pinker|first=Steven|title=The Language Instinct|year=1994|publisher=William Morrow}}{{cite journal | doi = 10.1016/j.cognition.2004.08.004 | title = The faculty of language: What's so special about it? | year = 2005 | last1 = Pinker | first1=Steven | last2 = Jackendoff | first2=Ray | journal = Cognition | volume = 95 | issue = 2 | pages = 201–236 | pmid=15694646| citeseerx = 10.1.1.116.7784 | s2cid = 1599505 }} [50] => [51] => This can be understood in terms of a recursive definition of a syntactic category, such as a sentence. A sentence can have a structure in which what follows the verb is another sentence: ''Dorothy thinks witches are dangerous'', in which the sentence ''witches are dangerous'' occurs in the larger one. So a sentence can be defined recursively (very roughly) as something with a structure that includes a noun phrase, a verb, and optionally another sentence. This is really just a special case of the mathematical definition of recursion. [52] => [53] => This provides a way of understanding the creativity of language—the unbounded number of grammatical sentences—because it immediately predicts that sentences can be of arbitrary length: ''Dorothy thinks that Toto suspects that Tin Man said that...''. There are many structures apart from sentences that can be defined recursively, and therefore many ways in which a sentence can embed instances of one category inside another.{{Cite web|url=https://www.thoughtco.com/recursion-grammar-1691901|title=What Is Recursion in English Grammar?|last=Nordquist|first=Richard|website=ThoughtCo|language=en|access-date=2019-10-24}} Over the years, languages in general have proved amenable to this kind of analysis. [54] => [55] => The generally accepted idea that recursion is an essential property of human language has been challenged by [[Daniel Everett]] on the basis of his claims about the [[Pirahã language]]. Andrew Nevins, David Pesetsky and Cilene Rodrigues are among many who have argued against this.{{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 |year=2009 |last1=Nevins |first1=Andrew |last2=Pesetsky |first2=David |last3=Rodrigues |first3=Cilene |journal=Language |volume=85 |issue=3 |pages=671–681 |s2cid=16915455 |archive-url=https://web.archive.org/web/20120106154616/http://web.mit.edu/linguistics/people/faculty/pesetsky/Nevins_Pesetsky_Rodrigues_2_Evidence_and_Argumentation_Reply_to_Everett.pdf |archive-date=2012-01-06}} Literary [[self-reference]] can in any case be argued to be different in kind from mathematical or logical recursion.{{cite book |last=Drucker|first=Thomas |title=Perspectives on the History of Mathematical Logic |url=https://books.google.com/books?id=R70M4zsVgREC&pg=PA110 |date=4 January 2008 |publisher=Springer Science & Business Media |isbn=978-0-8176-4768-1 |page=110}} [56] => [57] => Recursion plays a crucial role not only in syntax, but also in [[natural language semantics]]. The word ''and'', for example, can be construed as a function that can apply to sentence meanings to create new sentences, and likewise for noun phrase meanings, verb phrase meanings, and others. It can also apply to intransitive verbs, transitive verbs, or ditransitive verbs. In order to provide a single denotation for it that is suitably flexible, ''and'' is typically defined so that it can take any of these different types of meanings as arguments. This can be done by defining it for a simple case in which it combines sentences, and then defining the other cases recursively in terms of the simple one.Barbara Partee and Mats Rooth. 1983. In Rainer Bäuerle et al., ''Meaning, Use, and Interpretation of Language''. Reprinted in Paul Portner and Barbara Partee, eds. 2002. ''Formal Semantics: The Essential Readings''. Blackwell. [58] => [59] => A [[recursive grammar]] is a [[formal grammar]] that contains recursive [[production (computer science)|production rules]].{{citation [60] => | last1 = Nederhof | first1 = Mark-Jan [61] => | last2 = Satta | first2 = Giorgio [62] => | contribution = Parsing Non-recursive Context-free Grammars [63] => | doi = 10.3115/1073083.1073104 [64] => | location = Stroudsburg, PA, USA [65] => | pages = 112–119 [66] => | publisher = Association for Computational Linguistics [67] => | title = Proceedings of the 40th Annual Meeting on Association for Computational Linguistics (ACL '02) [68] => | year = 2002| doi-access = free [69] => }}. [70] => [71] => ===Recursive humor=== [72] => 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: [73] => :Recursion, ''see Recursion''.{{cite book|last=Hunter|first=David|title=Essentials of Discrete Mathematics|year=2011|publisher=Jones and Bartlett|pages=494|url=https://books.google.com/books?id=kuwhTxCVovQC&q=recursion+joke|isbn=9781449604424}} [74] => [75] => A variation is found on page 269 in the [[Back-of-the-book index|index]] of some editions of [[Brian Kernighan]] and [[Dennis Ritchie]]'s book ''[[The C Programming Language]]''; the index entry recursively references itself ("recursion 86, 139, 141, 182, 202, 269"). Early versions of this joke can be found in ''Let's talk Lisp'' by Laurent Siklóssy (published by Prentice Hall PTR on December 1, 1975, with a copyright date of 1976) and in ''Software Tools'' by Kernighan and Plauger (published by Addison-Wesley Professional on January 11, 1976). The joke also appears in ''The UNIX Programming Environment'' by Kernighan and Pike. It did not appear in the first edition of ''The C Programming Language''. The joke is part of the [[functional programming]] folklore and was already widespread in the functional programming community before the publication of the aforementioned books. {{cite web |last1=Shaffer |first1=Eric |title=CS 173:Discrete Structures |url=https://courses.engr.illinois.edu/cs173/sp2009/Lectures/lect_19.pdf |publisher=University of Illinois at Urbana-Champaign |access-date=7 July 2023}} {{cite web |title=Introduction to Computer Science and Programming in C; Session 8: September 25, 2008 |url=http://www.cs.columbia.edu/~bert/courses/1003/lecture8.pdf |publisher=Columbia University |access-date=7 July 2023}} [76] => [77] => [[File:Toronto recursive history plaque.jpg|thumb|A plaque commemorates the Toronto Recursive History Project of Toronto's Recursive History.]] [78] => [79] => Another joke is that "To understand recursion, you must understand recursion." 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''."{{Cite web|url=https://www.google.com/search?q=recursion|title=recursion - Google Search|website=www.google.com|access-date=2019-10-24}} 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."'' [80] => [81] => [[Recursive acronym]]s are other examples of recursive humor. [[PHP]], for example, stands for "PHP Hypertext Preprocessor", [[Wine (software)|WINE]] stands for "WINE Is Not an Emulator", [[GNU]] stands for "GNU's not Unix", and [[SPARQL]] denotes the "SPARQL Protocol and RDF Query Language". [82] => [83] => ==In mathematics== [84] => [[File:Sierpinski triangle.svg|thumb|250px|The [[Sierpinski triangle]]—a confined recursion of triangles that form a fractal]] [85] => [86] => ===Recursively defined sets=== [87] => {{Main|Recursive definition}} [88] => [89] => ====Example: the natural numbers==== [90] => {{See also|Closure (mathematics)}} [91] => The canonical example of a recursively defined set is given by the [[natural numbers]]: [92] => [93] => :0 is in \mathbb{N} [94] => :if ''n'' is in \mathbb{N}, then ''n'' + 1 is in \mathbb{N} [95] => :The set of natural numbers is the smallest set satisfying the previous two properties. [96] => [97] => In mathematical logic, the [[Peano axioms]] (or Peano postulates or Dedekind–Peano axioms), are axioms for the natural numbers presented in the 19th century by the German mathematician [[Richard Dedekind]] and by the Italian mathematician [[Giuseppe Peano]]. The Peano Axioms define the natural numbers referring to a recursive successor function and addition and multiplication as recursive functions. [98] => [99] => ====Example: Proof procedure ==== [100] => Another interesting example is the set of all "provable" propositions in an [[axiomatic system]] that are defined in terms of a [[proof procedure]] which is inductively (or recursively) defined as follows: [101] => [102] => *If a proposition is an axiom, it is a provable proposition. [103] => *If a proposition can be derived from true reachable propositions by means of inference rules, it is a provable proposition. [104] => *The set of provable propositions is the smallest set of propositions satisfying these conditions. [105] => [106] => ===Finite subdivision rules=== [107] => {{Main|Finite subdivision rule}} [108] => 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]]. [109] => [110] => ===Functional recursion=== [111] => A [[function (mathematics)|function]] may be recursively 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 be reducible to non-recursively defined values: in this case ''F''(0) = 0 and ''F''(1) = 1. [112] => [113] => ===Proofs involving recursive definitions=== [114] => 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. [115] => [116] => ===Recursive optimization=== [117] => [[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). [118] => [119] => ===The recursion theorem=== [120] => In [[set theory]], this is a theorem guaranteeing that recursively defined functions exist. Given a set {{mvar|X}}, an element {{mvar|a}} of {{mvar|X}} and a function {{math|''f'': ''X'' → ''X''}}, the theorem states that there is a unique function F: \N \to X (where \N denotes the set of natural numbers including zero) such that [121] => :F(0) = a [122] => :F(n + 1) = f(F(n)) [123] => for any natural number {{mvar|n}}. [124] => [125] => Dedekind was the first to pose the problem of unique definition of set-theoretical functions on \mathbb N by recursion, and gave a sketch of an argument in the 1888 essay "Was sind und was sollen die Zahlen?" A. Kanamori, "[https://math.bu.edu/people/aki/20.pdf In Praise of Replacement]", pp.50--52. Bulletin of Symbolic Logic, vol. 18, no. 1 (2012). Accessed 21 August 2023. [126] => [127] => ====Proof of uniqueness==== [128] => Take two functions F: \N \to X and G: \N \to X such that: [129] => [130] => :F(0) = a [131] => :G(0) = a [132] => :F(n + 1) = f(F(n)) [133] => :G(n + 1) = f(G(n)) [134] => [135] => where {{mvar|a}} is an element of {{mvar|X}}. [136] => [137] => It can be proved by [[mathematical induction]] that {{math|1=''F''(''n'') = ''G''(''n'')}} for all natural numbers [138] => {{mvar|n}}: [139] => [140] => :'''Base Case''': {{math|1=''F''(0) = ''a'' = ''G''(0)}} so the equality holds for {{math|1=''n'' = 0}}. [141] => [142] => :'''Inductive Step''': Suppose {{math|1=''F''(''k'') = ''G''(''k'')}} for some {{nowrap|k \in \N.}} Then {{math|1=''F''(''k'' + 1) = ''f''(''F''(''k'')) = ''f''(''G''(''k'')) = ''G''(''k'' + 1)}}. [143] => ::Hence {{math|1=''F''(''k'') = ''G''(''k'')}} implies {{math|1=''F''(''k'' + 1) = ''G''(''k'' + 1)}}. [144] => [145] => By induction, {{math|1=''F''(''n'') = ''G''(''n'')}} for all n \in \N. [146] => [147] => ==In computer science== [148] => {{Main|Recursion (computer science)}} [149] => 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. [150] => [151] => A classic example of recursion is the definition of the [[factorial]] function, given here in [[Python (programming language)|Python]] code: [152] => [153] => def factorial(n): [154] => if n > 0: [155] => return n * factorial(n - 1) [156] => else: [157] => return 1 [158] => [159] => [160] => The function calls itself recursively on a smaller version of the input {{code|(n - 1)}} and multiplies the result of the recursive call by {{code|n}}, until reaching the [[base case (recursion)|base case]], analogously to the mathematical definition of factorial. [161] => [162] => 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. [163] => [164] => [[Recurrence relation]]s are equations which define one or more sequences recursively. Some specific kinds of recurrence relation can be "solved" to obtain a non-recursive definition (e.g., a [[closed-form expression]]). [165] => [166] => Use of recursion in an algorithm has both advantages and disadvantages. The main advantage is usually the simplicity of instructions. The main disadvantage is that the memory usage of recursive algorithms may grow very quickly, rendering them impractical for larger instances. [167] => [168] => ==In biology== [169] => Shapes that seem to have been created by recursive processes sometimes appear in plants and animals, such as in branching structures in which one large part branches out into two or more similar smaller parts. One example is [[Romanesco broccoli]].{{cite web |title=Picture of the Day: Fractal Cauliflower |date=28 December 2012 |url=https://twistedsifter.com/2012/12/fractal-cauliflower-romanesco-broccoli/ |access-date=19 April 2020}} [170] => [171] => == In the social sciences == [172] => Authors use the concept of ''recursivity'' to foreground the situation in which specifically ''social'' scientists find themselves when producing knowledge about the world they are always already part of.{{Cite journal |last=Bourdieu |first=Pierre |year=1992 |title=Double Bind et Conversion |journal=Pour Une Anthropologie Réflexive |publisher=Le Seuil |publication-place=Paris}}{{Cite book |last=Giddens |first=Anthony |title=Social Theory and Modern Sociology |publisher=Polity Press |year=1987}} According to Audrey Alejandro, “as social scientists, the recursivity of our condition deals with the fact that we are both subjects (as discourses are the medium through which we analyse) and objects of the academic discourses we produce (as we are social agents belonging to the world we analyse).”{{Cite journal |last=Alejandro |first=Audrey |date=2021 |title=Reflexive discourse analysis: A methodology for the practice of reflexivity |url=http://journals.sagepub.com/doi/10.1177/1354066120969789 |journal=[[European Journal of International Relations]] |language=en |volume=27 |issue=1 |page=171 |doi=10.1177/1354066120969789 |s2cid=229461433 |issn=1354-0661|doi-access=free }} From this basis, she identifies in recursivity a fundamental challenge in the production of emancipatory knowledge which calls for the exercise of [[Reflexivity (social theory)|reflexive]] efforts:{{quote|we are socialised into discourses and dispositions produced by the socio-political order we aim to challenge, a socio-political order that we may, therefore, reproduce unconsciously while aiming to do the contrary. The recursivity of our situation as scholars – and, more precisely, the fact that the dispositional tools we use to produce knowledge about the world are themselves produced by this world – both evinces the vital necessity of implementing reflexivity in practice and poses the main challenge in doing so.|Audrey Alejandro| {{Harvp|Alejandro|2021}}}} [173] => [174] => ==In business== [175] => {{Further information|Management cybernetics}} [176] => [177] => Recursion is sometimes referred to in [[management science]] as the process of iterating through levels of abstraction in large business entities.{{cite web |title=The Canadian Small Business–Bank Interface: A Recursive Model |url=https://journals.sagepub.com/doi/pdf/10.1177/104225879401800401 |publisher=SAGE Journals}} A common example is the recursive nature of management [[hierarchy|hierarchies]], ranging from [[line management]] to [[senior management]] via [[middle management]]. It also encompasses the larger issue of [[capital structure]] in [[corporate governance]].{{cite book |last1=Beer |first1=Stafford |title=Brain Of The Firm |date=1972 |isbn=978-0471948391}} [178] => [179] => ==In art== [180] => [[File:First matryoshka museum doll open.jpg|thumb|Recursive dolls: the original set of [[Matryoshka doll]]s by [[Vasily Zvyozdochkin|Zvyozdochkin]] and [[Sergey Malyutin|Malyutin]], 1892]] [181] => [[File:Polittico stefaneschi, verso.jpg|thumb|left|Front face of [[Giotto]]'s ''[[Stefaneschi Triptych]]'', 1320, recursively contains an image of itself (held up by the kneeling figure in the central panel).]] [182] => {{See also|Mathematics and art|Infinity mirror}} [183] => [184] => The [[Matryoshka doll]] is a physical artistic example of the recursive concept.{{cite web |last1=Tang |first1=Daisy |title=Recursion |url=http://www.cpp.edu/~ftang/courses/CS240/lectures/recursion.htm |access-date=24 September 2015 |quote=More examples of recursion: Russian Matryoshka dolls. Each doll is made of solid wood or is hollow and contains another Matryoshka doll inside it.}} [185] => [186] => Recursion has been used in paintings since [[Giotto]]'s ''[[Stefaneschi Triptych]]'', made in 1320. Its central panel contains the kneeling figure of Cardinal Stefaneschi, holding up the triptych itself as an offering.{{cite web |title=Giotto di Bondone and assistants: Stefaneschi triptych |url=http://mv.vatican.va/3_EN/pages/PIN/PIN_Sala02_03.html |publisher=The Vatican |access-date=16 September 2015}}{{Cite book |title=Physical (A)Causality: Determinism, Randomness and Uncaused Events |url=https://books.google.com/books?id=gxBMDwAAQBAJ&pg=PA12 |first=Karl |last=Svozil |year=2018 |publisher=Springer |pages=12| isbn=9783319708157 }} This practice is more generally known as the [[Droste effect]], an example of the [[Mise en abyme]] technique. [187] => [188] => [[M. C. Escher]]'s ''[[Print Gallery (M. C. Escher)|Print Gallery]]'' (1956) is a print which depicts a distorted city containing a gallery which [[recursive]]ly contains the picture, and so ''[[ad infinitum]]''.{{cite web |last1=Cooper |first1=Jonathan |title=Art and Mathematics |url=https://unwrappingart.com/art/art-and-mathematics/ |access-date=5 July 2020 |date=5 September 2007}} [189] => {{Clear}} [190] => [191] => == In culture == [192] => The film ''[[Inception]]'' has colloquialized the appending of the suffix ''[[wiktionary:-ception|-ception]]'' to a noun to jokingly indicate the recursion of something.{{cite web |title=-ception – The Rice University Neologisms Database |url=http://neologisms.rice.edu/index.php?a=term&d=1&t=17573 |url-status=live |archive-url=https://web.archive.org/web/20170705153941/http://neologisms.rice.edu/index.php?a=term&d=1&t=17573 |archive-date=July 5, 2017 |access-date=December 23, 2016 |publisher=Rice University}} [193] => [194] => ==See also== [195] => * {{Annotated link|Corecursion}} [196] => * {{Annotated link|Course-of-values recursion}} [197] => * {{Annotated link|Digital infinity}} [198] => * {{Annotated link|A Dream Within a Dream (poem)}} [199] => * {{Annotated link|Droste effect}} [200] => * {{Annotated link|False awakening}} [201] => * {{Annotated link|Fixed point combinator}} [202] => * {{Annotated link|Infinite compositions of analytic functions}} [203] => * {{Annotated link|Infinite loop}} [204] => * {{Annotated link|Infinite regress}} [205] => * {{Annotated link|Infinitism}} [206] => * {{Annotated link|Infinity mirror}} [207] => * {{Annotated link|Iterated function}} [208] => * {{Annotated link|Mathematical induction}} [209] => * {{Annotated link|Mise en abyme}} [210] => [212] => * {{Annotated link|Reentrant (subroutine)}} [213] => * {{Annotated link|Self-reference}} [214] => * {{Annotated link|Spiegel im Spiegel}} [215] => * {{Annotated link|Strange loop}} [216] => * {{Annotated link|Tail recursion}} [217] => * {{Annotated link|Tupper's self-referential formula}} [218] => * {{Annotated link|Turtles all the way down}} [219] => [220] => ==References== [221] => {{Reflist}} [222] => [223] => ==Bibliography== [224] => {{refbegin}} [225] => * {{cite journal|first=Edsger W.|last=Dijkstra|author-link=Edsger W. Dijkstra|title=Recursive Programming|journal=Numerische Mathematik|volume=2|issue=1|year=1960|pages=312–318|doi=10.1007/BF01386232|s2cid=127891023}} [226] => *{{cite book | author=Johnsonbaugh, Richard|author-link=Richard Johnsonbaugh | title=Discrete Mathematics | publisher=Prentice Hall | year=2004 | isbn=978-0-13-117686-7 }} [227] => *{{cite book | author=Hofstadter, Douglas | author-link=Douglas Hofstadter | title=Gödel, Escher, Bach: an Eternal Golden Braid | publisher=Basic Books | year=1999 | isbn=978-0-465-02656-2 | url=https://archive.org/details/gdelescherbachet00hofs }} [228] => *{{cite book | author=Shoenfield, Joseph R. |author-link=Joseph R. Shoenfield| title=Recursion Theory | url=https://archive.org/details/recursiontheory0000shoe | url-access=registration | publisher=A K Peters Ltd | year=2000 | isbn=978-1-56881-149-9 }} [229] => *{{cite book | author=[[Causey, Robert L.]] | title=Logic, Sets, and Recursion | url=https://archive.org/details/logicsetsrecursi0000caus | url-access=registration | publisher=Jones & Bartlett | year=2001 | isbn=978-0-7637-1695-0 }} [230] => *{{cite book |author1=Cori, Rene |author2=Lascar, Daniel |author3=Pelletier, Donald H. | title=Recursion Theory, Gödel's Theorems, Set Theory, Model Theory | publisher=Oxford University Press | year=2001 | isbn=978-0-19-850050-6 }} [231] => *{{cite book | author1=Barwise, Jon| author2=Moss, Lawrence S. |author1-link=Jon Barwise| title=Vicious Circles | publisher=Stanford Univ Center for the Study of Language and Information | year=1996 | isbn=978-0-19-850050-6 }} - offers a treatment of [[corecursion]]. [232] => *{{cite book | author=Rosen, Kenneth H. | title=Discrete Mathematics and Its Applications | publisher=McGraw-Hill College | year=2002 | isbn=978-0-07-293033-7 }} [233] => *{{cite book | last1=Cormen |first1=Thomas H. |first2=Charles E. |last2=Leiserson |first3=Ronald L. |last3=Rivest |first4=Clifford |last4=Stein | title=Introduction to Algorithms | publisher=Mit Pr | year=2001 | isbn=978-0-262-03293-3 }} [234] => *{{cite book |author1=Kernighan, B. |author2=Ritchie, D. |title=The C programming Language |publisher=Prentice Hall |year=1988 |isbn=978-0-13-110362-7 |url=https://archive.org/details/cprogramminglang00bria }} [235] => *{{cite book |author1=Stokey, Nancy |author2=Robert Lucas |author3=Edward Prescott | title=Recursive Methods in Economic Dynamics | publisher=Harvard University Press | year=1989 | isbn=978-0-674-75096-8}} [236] => *{{cite book | author=Hungerford |title=Algebra | publisher=Springer|year=1980|isbn=978-0-387-90518-1}}, first chapter on set theory. [237] => {{refend}} [238] => [239] => ==External links== [240] => {{Commons category}} [241] => {{Wiktionary|recursion|recursivity}} [242] => * [https://web.archive.org/web/20050206051223/http://www.freenetpages.co.uk/hp/alan.gauld/tutrecur.htm Recursion] - tutorial by Alan Gauld [243] => * [http://research.swtch.com/2010/03/zip-files-all-way-down.html Zip Files All The Way Down] [244] => *[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)] [245] => [246] => {{Fractals}} [247] => {{Mathematical logic}} [248] => {{Authority control}} [249] => [250] => [[Category:Recursion| ]] [251] => [[Category:Theory of computation]] [252] => [[Category:Self-reference]] [253] => [[Category:Feedback]] [254] => [[Category:Articles with example C code]] [] => )
good wiki

Recursion

Recursion is a programming concept that involves a function or method calling itself during its execution. It is a powerful technique used in many programming languages for solving complex problems by breaking them down into smaller, more manageable sub-problems.

More about us

About

It is a powerful technique used in many programming languages for solving complex problems by breaking them down into smaller, more manageable sub-problems. In mathematics, recursion refers to the process of defining a function or sequence based on itself. This concept is often used in mathematical proofs and the study of algorithms. In computer science, recursion is widely used for solving problems that can be broken down into smaller, similar problems. It allows for the creation of elegant and efficient algorithms, especially for tasks that would be difficult or impossible to solve iteratively. The Wikipedia page on recursion explains the concept in detail, including its history and applications in various fields. It provides examples of recursive functions in different programming languages, along with explanations of how they work. The page also covers some common pitfalls and challenges associated with recursion, such as infinite loops and excessive memory usage. It offers guidance on how to design and analyze recursive algorithms, including methods like base cases and recursive calls. Overall, the Wikipedia page on recursion is a comprehensive resource for anyone looking to understand this fundamental concept in computer science and mathematics. It provides a thorough overview and serves as a valuable reference for both beginners and experienced programmers.

Expert Team

Vivamus eget neque lacus. Pellentesque egauris ex.

Award winning agency

Lorem ipsum, dolor sit amet consectetur elitorceat .

10 Year Exp.

Pellen tesque eget, mauris lorem iupsum neque lacus.

You might be interested in

GNU

GNU is a free and open-source operating system developed by Richard Stallman and the GNU Project.

Integer

An integer is a number that can be written without a fractional or decimal component.

Linguistics

Linguistics is the scientific study of language and its structure, including the sounds, words, and grammar used in communication.

Logic

Logic is the study of reasoning and inference, and uses mathematical techniques to investigate the principles of correct reasoning.

Mathematics

Mathematics is a branch of science that deals with the study of numbers, quantities, and shapes.

SPARQL

SPARQL (pronounced "sparkle", a recursive acronym for SPARQL Protocol and RDF Query Language) is an RDF query language-that is, a semantic query language for databases-able to retrieve and manipulate data stored in Resource Description Framework (RDF) format.