Theorem 9.2.1: the membership problem for Turing machines is undecidable, or alternatively, the language L(u) = {encode(T) w| T is T.M. and w_L(T)} is not total Turing-recognizable.
Corollary 9.2.2: _Ld is (partial) Turing-recognizable.
Previous slide | Next slide | Back to first slide | View graphic version |