Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00775789n
Noun Concept
Categories: Mathematical logic, Computability theory
EN
computability theory  Continuous computability theory  Ecursion theory  recursion theory  recursive function theory
EN
Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. Wikipedia
English:
computer science
Definitions
Relations
Sources
EN
Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. Wikipedia
The branch of the theory of computation that studies which problems are computationally solvable using different models. Wiktionary
IS A
symbolic logic
theory of computation
theoretical computer science
HAS PART
Smn theorem
HAS KIND
computational complexity theory
Kleene's recursion theorem
pumping lemma
Ackermann function
computability
Wikipedia
EN
computability theory
Wikidata
EN
computability theory
Wiktionary
EN
computability theory
Wikipedia Redirections
EN
Computability Theory, Computability theory (computation), Continuous computability theory, Ecursion theory, recursion theory, recursive function theory, theory of computability, Turing computability
Wikidata Alias
EN
recursion theory

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License