recursion theory
recursion theory noun: a branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function on the natural numbers to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?".
Noun
recursion theory (uncountable)
- A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function on the natural numbers to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?".
- Synonyms:
- computability theory
Synonyms of recursion theory
Questions about recursion theory
- What does recursion theory mean?
- Recursion theory means a branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function on the natural numbers to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?".
- What part of speech is recursion theory?
- Recursion theory is a noun.
Words near recursion theory in the dictionary
Source and license
Adapted from Wiktionary: recursion theory (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “recursion theory.” Word.ws, https://word.ws/recursion_theory. Based on Wiktionary, CC BY-SA 4.0.
