Recursion theorem: Difference between revisions
Content deleted Content added
No edit summary |
Changed link to point to specific section |
||
| Line 1: | Line 1: | ||
'''Recursion theorem''' can refer to: |
'''Recursion theorem''' can refer to: |
||
* The [[Recursion|recursion theorem]] in set theory |
* The [[Recursion#The_recursion_theorem|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 |
* The [[master theorem]] about complexity of divide-and-conquer algorithms |
||
Revision as of 10:38, 9 June 2017
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.