Definition:Computability Theory

From ProofWiki
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

  • Results about computability theory can be found here.