I am trying to understand why this "proof" of Etm undecidability is wrong.
ALLtm={ < M >|M is a TM, L(M)=∑*}
ETM={< M >|M is a TM, L(M)=∅
