1 votes 1 votes How to solve turing machine decidable/undecidable questions ? Do I need to mug them up ? Theory of Computation turing-machine decidability + – ♥_Less asked Oct 6, 2017 ♥_Less 328 views answer comment Share Follow See 1 comment See all 1 1 comment reply Rupendra Choudhary commented Oct 7, 2017 reply Follow Share No mugging up , at least this won't help in GATE http://gatecse.in/rices-theorem/ Rice theorem will help here 0 votes 0 votes Please log in or register to add a comment.