Category:Computability theory
Wikimedia Commons has media related to Computability theory.
This category is for articles about computability theory, also known as recursion theory, a branch of mathematical logic and computer science concerned with generalizations of the notion of computable function, and with related concepts such as Turing degrees.
Related information about computability theory in computer science is described in the theory of computation article and is categorized in Category:Theory of computation.
Subcategories
This category has the following 2 subcategories, out of 10 total.
(previous page) (next page)T
- Turing machine (31 P)
U
- Undecidable problems (24 P)
Pages in category "Computability theory"
The following 8 pages are in this category, out of 101 total. This list may not reflect recent changes.
(previous page) (next page)(previous page) (next page)