1,695 views
1 votes
1 votes
Halting problem of Turing machines which recognize recursive languages is undecidable. (True / False)

3 Answers

Best answer
5 votes
5 votes
False.

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

 

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

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. 

Related questions

11 votes
11 votes
2 answers
1
sourav. asked Sep 9, 2017
4,377 views
My Question $\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$I have to check that it is Turing Recogniza...
3 votes
3 votes
2 answers
3