1
It's well-known that the language $A_{TM} = \{\langle M,w\rangle: \text{M is a turing machine that accepts w} \}$ is undecidable.
There's a standard proof that's presented in Sipser's "Introduction to the theory of Computation" (and in a number of other online sources I've checked). It's often cl...
