Question

Assume that the halting language iddle" class="latex-formula"> is reducible to
some language B ($H_T_M$ $\leq$ $_m$ B). Is it possible that is decidable? Answer true/false and explain. Please help me this answer?

Answer 1

H_TM is reduced to HALT_TM and as such, HALT_TM is undecidable.

How to Interpret Machine Language?

A language is referred to as Decidable or Recursive if there is a Turing machine that accepts and halts on every input string w. This tells us that every decidable language is Turing-Acceptable.

Now, we are told that the halting language is reducible to some language B. This means that it is an undecidability via reduction.

Now, Using the idea that “ If A is undecidable and reducible to B, then B is undecidable.” Suppose R decides HALT_TM, we will construct S to decide ATM .

S = “On input (M, B)

This means that H_TM is reduced to HALT_TM and as such, HALT_TM is undecidable.

Read more about machine language at; brainly.com/question/28026656

#SPJ1