0 votes 0 votes Theory of Computation theory-of-computation + – pranab ray asked Dec 8, 2017 pranab ray 345 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Anu007 commented Dec 8, 2017 i edited by Anu007 Dec 9, 2017 reply Follow Share c is answer. till recursive enumerable we have enumerator A language is Turing recognizable if and only if some enumerator enumerates it. but for non re no enumerator 0 votes 0 votes Ashwin Kulkarni commented Dec 8, 2017 reply Follow Share @Anu007 sir, Turing machines are countable hence RE also countable and hence we can enumarate REL as well . and hence I think ans should be D 0 votes 0 votes pranab ray commented Dec 9, 2017 reply Follow Share i also thought D as answer .....set of all recursive enumerable language=set of all turing machine which are countable ..but given answer as C . but set of all language over 0,1 is also having enumeration method . 0 votes 0 votes Ashwin Kulkarni commented Dec 9, 2017 reply Follow Share Ohh sorry i read alphabets! yes option C is true! set of all languages 2^sigma* is uncountable! we can prove it by diagonalization method. 0 votes 0 votes Please log in or register to add a comment.
