Next:
Theorem 1
Up:
Decidability
Previous:
decidable doesn't mean we
Decidability Theorems
Theorem 1
The complement of a recursive language is recursive
Theorem 2
The union of two recursive languages is recursive
Theorem 3
If a language and it's complement are r.e, they are both recursive
Implications of Theorem 3
root
6/10/1998