Definition:Computability Theory
Jump to navigation
Jump to search
Definition
Computability theory is a branch of mathematical logic which concerns itself with the algorithmic implementation of mathematical proofs.
Also see
- Definition:Recursion Theory: some sources bracket computability theory and recursion theory into the same category.
- Results about computability theory can be found here.