0 votes 0 votes Theory of Computation complexity-theory decidability ace-test-series theory-of-computation + – saxena0612 asked Dec 7, 2017 • edited Mar 7, 2019 by Rishi yadav saxena0612 300 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Dec 7, 2017 reply Follow Share for 2) REL but not recursive is not decidable, because for REL but not recursive languages, you does not have halting TM, rest all are decidable. 2 votes 2 votes Diksha Aswal commented Dec 7, 2017 reply Follow Share What's PSPACE and NPSAPCE ? 0 votes 0 votes Please log in or register to add a comment.