2

Prove that the following language L is undecidable by reducing the language A_TM (i.e., the acceptance problem) to language L. A_TM = {|M is a TM and M accepts w} L = {| M is a TM and there is at least one input string on which M halts}