1 votes 1 votes Ans. D Theory of Computation decidability theory-of-computation turing-machine + – Na462 asked Sep 2, 2018 Na462 213 views answer comment Share Follow See 1 comment See all 1 1 comment reply Na462 commented Sep 2, 2018 reply Follow Share I f we see both problems as graph reachability problem then both problems are decidable. But the second problem is the state entry problem right ? i.e. on input wether turing machine enter the state q or not and its undecidable. So i am confused here 0 votes 0 votes Please log in or register to add a comment.
