5 votes 5 votes Theory of Computation theory-of-computation turing-machine decidability + – monty asked Oct 26, 2016 monty 839 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply monty commented Oct 26, 2016 reply Follow Share Pls Verify answer a,b,c state entry problem d,e decidable f, g undecidable h,i decidable j,k decidable l,m semidecidable @Arjun sir @ Motamarri Anusha 0 votes 0 votes monty commented Oct 27, 2016 reply Follow Share @Arjun Sir pls verify Answers THanks. 0 votes 0 votes Anu007 commented Oct 27, 2016 reply Follow Share Monty for D u can not say always yes or no .. if it halt then u say yes .. if not halt then u keep waiting in loop so no case no possible always. so only semidecidable. 0 votes 0 votes Please log in or register to add a comment.