Difference between revisions of "Recursion"

From PKC
Jump to navigation Jump to search
m (Text replacement - "{{#ev:youtube |" to "{{#widget:YouTube |id=")
 
(7 intermediate revisions by the same user not shown)
Line 2: Line 2:
  <math>x = f(x)</math>
  <math>x = f(x)</math>
It is a reflexive structure and is the prototypical definition that defines [[fixed point]].
It is a reflexive structure and is the prototypical definition that defines [[fixed point]].
=Superb explanations=
To get a general understanding of this topic, watch these videos<ref>{{:Video/5 Simple Steps for Solving Any Recursive Problem}}</ref><ref>{{:Video/Programming Loops vs Recursion - Computerphile}}</ref>.
{{#widget:YouTube
|id=ngCos392W4w
}}
{{#widget:YouTube
|id=HXNhEYqFo0o
}}


<noinclude>
<noinclude>
=References=
<references/>
==Related Pages==
==Related Pages==
*[[Logically related::Self reflection]]
[[Category:Self reflection]]
*[[Logically related::Fixed point]]
[[Category:Fixed point]]
</noinclude>
</noinclude>

Latest revision as of 13:48, 26 August 2022

Recursion is a reflexive structure that maps input to outputs in the following sense:


It is a reflexive structure and is the prototypical definition that defines fixed point.

Superb explanations

To get a general understanding of this topic, watch these videos[1][2].



References

  1. Reducible, ed. (Dec 12, 2019). 5 Simple Steps for Solving Any Recursive Problem. local page: Reducible. 
  2. Brailsford, David (Sep 22, 2017). Programming Loops vs Recursion - Computerphile. local page: Computerphile. 

Related Pages