1 votes 1 votes In the deciadability chart mentioned on http://gatecse.in/grammar-decidable-and-undecidable-problems/ The undecidable problems mentioned here are semidecidable(RE but not REC) not NOT RE.Or there is no such relation? Can someone have a look and tell please? Theory of Computation decidability theory-of-computation recursive-and-recursively-enumerable-languages turing-machine + – rahul sharma 5 asked Jan 15, 2017 retagged Jul 4, 2017 by Arjun rahul sharma 5 747 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Hi there, Although I haven't encountered any semi-decidability related problems in my preparation (GATE '18) yet, I googled for the same after reading your question. Hope the following link helps, http://cs.stackexchange.com/questions/19641/can-a-semi-decidable-problem-be-also-decidable I will update this answer if I can clarify your doubt precisely. asterixbachman answered Jan 15, 2017 asterixbachman comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes They all are semidecidable. Lucky sunda answered Jan 20, 2017 Lucky sunda comment Share Follow See all 0 reply Please log in or register to add a comment.