Computability Theory
- Category :
- Concept
- Tags :
- general_computing_gleanings
- computer_science
- theory_of_computation
- c
- Created:
Table of Contents
About
Computability theory, also known as recursion theory, is the 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; the field has since expanded to include the study of generalised computability and definability; it overlaps in these areas with proof theory and effective descriptive set theory1.
Anki
Links
References
Wikipedia. “Computability Theory”. Available at: https://en.wikipedia.org/wiki/Computability_theory. (Accessed: ). ↩︎