Question: Prove that the language S = (M| M is a Turing machine that halts on at least one input) is not decidable using the fact

Prove that the language S = (M| M is a Turing machine that halts on at least one input) is not decidable using the fact that the halting language H = ((M, w)| M is a Turing machine that halts on input w) is not decidable
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
