Greetings,
I had a question regarding the empty language L_e: from the discussion we had we proved that L_e is not in RE, given that is complement L_ne (non-empty language) is in RE, therefore L_e cannot be recursive.
But is it no true that i could build a TM M such that L(M) = L_e which always halts? More, precisely, wouldn't be sufficient to build M so that it would reject any string given as input?