Category:Definitions/Computability Theory
Jump to navigation
Jump to search
This category contains definitions related to Computability Theory.
Related results can be found in Category:Computability Theory.
Computability theory is a branch of mathematical logic which concerns itself with the algorithmic implementation of mathematical proofs.
Subcategories
This category has the following 2 subcategories, out of 2 total.
E
R
Pages in category "Definitions/Computability Theory"
The following 18 pages are in this category, out of 18 total.
C
- Definition:Computability Theory
- Definition:Computable Complex Number
- Definition:Computable Rational Sequence
- Definition:Computable Real Function
- Definition:Computable Real Number
- Definition:Computable Real Sequence
- Definition:Computable Real-Valued Function
- Definition:Computably Uniformly Continuous Real Function
- Definition:Computably Uniformly Continuous Real-Valued Function