I was given this problem to be proved undecidable:Given a Turing Machine M, is it possible to decide whether exists  a string w on which M halts?Obviously it is undecidable, but how can I prove it?Thank you for the help.
Easy question regarding Turing Machine's halting
turing machines;halting problem