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?".

Meanings

nounrecursion theory (uncountable)
  1. uncountablehuman sciencesA 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 & antonyms

nounA 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?".

Cite this entry
APA

recursion theory. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/recursion%20theory

MLA

“recursion theory.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/recursion%20theory. Accessed November 3, 2026.

Chicago

WatkinsX Dictionary, s.v. “recursion theory,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/recursion%20theory.

Source: recursion theory on Wiktionary, CC BY-SA 4.0.