Question about proving a language is in RE

Re: Question about proving a language is in RE

by Giorgio Satta -
Number of replies: 0

The problem in your message is the proof that Lp is in RE.

You say: if M accepts, then there exists an odd length string in L(M), so N rejects. But you do not specify when N accepts. In fact there is no effective criterion for N to accept input enc(M) ... think about it and you will see that nothing works for acceptance.