Category:Computability Theory

From ProofWiki
Jump to navigation Jump to search

This category contains results about Computability Theory.
Definitions specific to this category can be found in Definitions/Computability Theory.

Computability theory is a branch of mathematical logic which concerns itself with the algorithmic implementation of mathematical proofs.


This category has the following 2 subcategories, out of 2 total.



Pages in category "Computability Theory"

The following 30 pages are in this category, out of 30 total.