formal languages – How would I prove that nondeterministic Turing machines are undecidable?


How would I go about proving that the language:

$$A_{NTM }= {langle N, wrangle | N text{ is a nondeterministic TM and } N text{ accepts }w}$$

is undecidable?

I looked at the proof for $A_{TM}$ being undecidable, but am struggling to figure out how to prove the above. Any ideas?