Recursion theorem: Difference between revisions
Content deleted Content added
m added Category:Monitored short pages |
No edit summary |
||
| Line 2: | Line 2: | ||
* The [[Recursion|recursion theorem]] in set theory |
* The [[Recursion|recursion theorem]] in set theory |
||
* [[Kleene's recursion theorem]], also called the fixed point theorem, in computability theory |
* [[Kleene's recursion theorem]], also called the fixed point theorem, in computability theory |
||
* The [[master theorem]] about complexity of divide-and-conquer algorithms |
|||
{{Disambig}} |
{{Disambig}} |
||
Revision as of 13:23, 29 May 2016
Recursion theorem can refer to:
- The recursion theorem in set theory
- Kleene's recursion theorem, also called the fixed point theorem, in computability theory
- The master theorem about complexity of divide-and-conquer algorithms
This disambiguation page lists articles associated with the title Recursion theorem.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
If an internal link led you here, you may wish to change the link to point directly to the intended article.