Definitions from Wiktionary (recursion theory)
▸ noun: (logic) 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?".
▸ Words similar to recursion theory
▸ Usage examples for recursion theory
▸ Idioms related to recursion theory
▸ Wikipedia articles (New!)
▸ Words that often appear near recursion theory
▸ Rhymes of recursion theory
▸ Invented words related to recursion theory
▸ noun: (logic) 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?".
Similar:
computability theory,
Kleene's recursion theorem,
recursion,
primitive recursion,
computability logic,
recurrence relation,
corecursion,
recursive descent,
Church-Turing thesis,
computable analysis,
more...
▸ Words similar to recursion theory
▸ Usage examples for recursion theory
▸ Idioms related to recursion theory
▸ Wikipedia articles (New!)
▸ Words that often appear near recursion theory
▸ Rhymes of recursion theory
▸ Invented words related to recursion theory