Halting problem of TM which recognize recursive languages is undecidable?

Question

Halting problem of Turing machines which recognize recursive languages is undecidable. (True / False)

Comments

The halting problem is recursively enumerable but not recursive.

A similar argument can be used to show that many practical problems associated with software verification are undecidable. For example, the problem of determining whether a program will ever go into an infinite loop is undecidable.

---

True

Answer 1

False.

The TM will definitely halt since it accepts recursive languages. Therefore the problem is decidable.

Answer 2

FALSE

 

recursive languages are recognised by halting turing machine so , telling whether the TM accepting recursive languge will halt or not is decidable.

Answer 3

Halting problem is undecidable for RE languages. But in question its mentioned for recursive. Here for all strings, either they will be accepted or rejected and then always halt. Hence its decidable. So the statement is false.