The Gateway to Computer Science Excellence
0 votes
Halting problem of Turing machines which recognize recursive languages is undecidable. (True / False)
in Theory of Computation by Active (2.1k points) | 206 views
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.

2 Answers

+3 votes
Best answer

The TM will definitely halt since it accepts recursive languages. Therefore the problem is decidable.
by Active (2.1k points)
0 votes


recursive languages are recognised by halting turing machine so , telling whether the TM accepting recursive languge will halt or not is decidable.
by Active (1.2k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,257 answers
104,734 users