computability theory

Noun

Meaning

(logic) Recursion theory.

(computer science) The branch of the theory of computation that studies which problems are computationally solvable using different models.

Source: en.wiktionary.org

Examples

Computability theory had its roots in the work of Turing, Church, Kleene, and Post in the 1930s and 40s. Source: Internet

Computability theory The first result of computability theory is that it is impossible in general to predict what a Turing-complete program will do over an arbitrarily long time. Source: Internet

Computability theory * citation *citation Some parts have been significantly rewritten by Burgess. Source: Internet

Close letter words and terms

compuspeak computability computability logic computable computable analysis computable function