0 votes 0 votes I think the question is wrong , it is related to closure properties of NP problems and NP problems are recursive so closed under concatenation, intersection, union, set difference. Correct me if i am wrong.. Theory of Computation theory-of-computation turing-machine + – vaishali jhalani asked Nov 19, 2016 vaishali jhalani 765 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply focus _GATE commented Nov 19, 2016 reply Follow Share p and np is not in syllabus .rt ?? 0 votes 0 votes vaishali jhalani commented Nov 19, 2016 reply Follow Share yes but P and NP classes both are recursive. 1 votes 1 votes Habibkhan commented Nov 19, 2016 reply Follow Share Yes the question's option is wrong... 1 votes 1 votes Please log in or register to add a comment.