How to prove that this language is not recursive enumerable? I need to prove that the following language is not recursively enumerable, while its compliment is recursive enumerable:
$L := \{w \in \{0,1\}^* |$ TM $M$ with $w = \langle $ M $\rangle$ does not receive any input $\}$.
Should I use reduction from the halting problem in this case?
You can directly use the extension of Rice's theorem to prove that $L\notin RE$