Short Note on Rice theorem.

53views

written 9.4 years ago by

teamques10 ★ 70k

Let C be a set of languages. Consider the language $L_c$ defined as follows

$L_c = {{M} | L {M} ∈ C}.$

Then either $L_c$ is empty, or it contains the descriptions of all Turing machines, or it is undecidable.

Proof:

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT