Category:Computability theory

From Wikipedia, the free encyclopedia
Jump to: navigation, search
The main article for this category is Computability theory.
Logic · Index of logic articles · Outline of logic 

This category is for articles about recursion theory, also called computability theory, which is 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 7 subcategories, out of 7 total.

C

E

H

L

T

Pages in category "Computability theory"

The following 94 pages are in this category, out of 94 total. This list may not reflect recent changes (learn more).

 

*

A

B

C

D

D cont.

E

F

G

H

I

K

L

M

N

O

P

R

S

T

U