1
L = { <M> | M is a Turing machine over {0, 1}, and <M>||<M> (not in) L(M)}
如何證明L不可識別?有任何想法嗎?如何證明以下語言不可判定?
我已經證明了L compliment
是可識別的:
Set Turing machine to J
1. Run J on input <M>||<M>
2. TM J accepts then accept, it reject the reject.
<M>||<M> is the concatenation of the encoding of the Turing machine.