Prove that ~E_TM (the complement of E_TM) is recognizable.
Prove that the following language is undecidable -- you may make use of any of the undecidable languages from class. B_TM = { < M > : M is a TM that halts on input epsilon } (Remember that "on input epsilon" means "when started with a blank input tape".)