Next:
Theorem 2
Up:
Theorem 1
Previous:
Theorem 1
The complement of a recursive language is recursive
Append a logical not to any algorithm, and it's still an algorithm [Hopcroft, Theorem 8.1].
root
6/10/1998
