0 votes 0 votes # plz check??? Theory of Computation testbook-test-series test-series + – Hradesh patel asked Jan 19, 2017 retagged Jun 4, 2017 by Arjun Hradesh patel 350 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply pranjalgennext commented Jan 19, 2017 reply Follow Share I think only I and III are correct as Recursive languages are Turing decidable and not Turing recognizable. 1 votes 1 votes focus _GATE commented Jan 19, 2017 reply Follow Share every REC is RE also so we called RE as turing recognisable so REC is turing recognisable according to chomsky heiarchy ?? 0 votes 0 votes Hradesh patel commented Jan 19, 2017 reply Follow Share @kunal i think recursive is Turing decidable and RE is Turing Recognisable........ i think (ii ) is wrong 1 votes 1 votes rahul sharma 5 commented Jan 19, 2017 reply Follow Share All of these.For ii)Turing recogonizable language means "For every member in machine ,it must halt and for non member it may/may not",So every REC will surely halt for member,so by this we can conclude that (ii) is also true.Please correct if i am wrong 1 votes 1 votes Please log in or register to add a comment.