Recursion: Difference between revisions

Content deleted Content added
OAbot (talk | contribs)
m Open access bot: doi updated in citation with #oabot.
m The recursion theorem: Fixed a parsing error in defining a new function
Tag: Reverted
Line 121:
 
===The recursion theorem===
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 <{{math>|''F'': <math>\N \to X</math> → ''X''}} (where <math>\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>