Theorem 5.1 Ld is not a recursively enumerable language. i.e.

, There is no Turing Machine that accepts Ld

Theorem 5.2 If L is a recursive language, so is L complement.

Theorem 5.3 If a language L and its complement are both recursive enumerable, then L is recursive.

Theorem 5.4 Lu is recursively enumerable.

Theorem 5.5 Lu is RE but not recursive.

Theorem 5.6 If there is a reduction from P1 to P2 then (i) (ii) If P1 is undecidable, then so is P2 If P1 is non-RE, then so is P2

Theorem 5.7 Lne is recursively enumerable.

Theorem 5.8 Lne is not recursive.

Theorem 5.9 (Rices theorem) Every non-trivial property of the RE language is undecidable.

Theorem 5.10 MPCP reduces to PCP

Theorem 5.11 Posts correspondence problem is undecidable.