Given ALL$_{\text{TM}}$ = { < M > | where M is a TM and L(M) = $^*$ } show this is undecidable. I'm also told not to use Rice's theorem. I'm having difficulties with reduction type problems. How would you do a proof for this using a reduction of A$_{\text{TM}}$? Any pointers to resources are much appreciated.
Prove ALL$_{\text{TM}}$ is undecidable reduction problem
computability;reductions;undecidability