Recursion theorem: Difference between revisions
Content deleted Content added
m Task 5: remove this page from Category:Long monitored short pages |
No edit summary Tag: Reverted |
||
| Line 3: | Line 3: | ||
* [[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 (analysis of algorithms)]], about the complexity of divide-and-conquer algorithms |
* The [[master theorem (analysis of algorithms)]], about the complexity of divide-and-conquer algorithms |
||
* Kudokato |
|||
{{Disambig}} |
{{Disambig}} |
||
Revision as of 06:41, 24 February 2024
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 (analysis of algorithms), about the complexity of divide-and-conquer algorithms
- Kudokato
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.