# Category:Computability Theory

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.

## Subcategories

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

### R

### U

- URM Programs (34 P)

## Pages in category "Computability Theory"

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

### C

- Composition of Computable Real Functions is Computable
- Composition of Computable Real-Valued Functions is Computable
- Composition of Computably Uniformly Continuous Real Functions is Computably Uniformly Continuous
- Composition of Computably Uniformly Continuous Real-Valued Functions is Computably Uniformly Continuous
- Composition of Sequentially Computable Real Functions is Sequentially Computable
- Composition of Sequentially Computable Real-Valued Functions is Sequentially Computable
- Computable Rational Sequence is Computable Real Sequence
- Computable Real Sequence iff Limits of Computable Rational Sequences
- Computable Subsequence of Computable Rational Sequence is Computable
- Computable Subsequence of Computable Rational Sequence is Computable/Corollary
- Constant Sequence of Computable Real Number is Computable
- Constant Sequence of Rational Number is Computable