0 0 votes Theory of Computation + – Vikas Verma 1.1k views answer comment Share Follow Print See 1 comment 1 1 comment reply Smishra95 commented Oct 15, 2018 reply Follow flag option D 0 0 replyShare Please log in or register to add a comment.
0 0 votes i think ans should be set of all real no because cardinality greater than real no's Nilabja Sarkar answered Oct 6, 2018 Nilabja Sarkar comment Share Follow See all 5 Comments 5 5 Comments reply Vikas Verma commented Oct 6, 2018 reply Follow flag But how can we enumerate set of all C programs 0 0 replyShare Nilabja Sarkar commented Oct 6, 2018 reply Follow flag c programming is based on CSL so its surely re. 0 0 replyShare amitqy commented Oct 15, 2018 reply Follow flag if a set is uncountable that means it is recursively enumerable ? 0 0 replyShare Nilabja Sarkar commented Oct 15, 2018 reply Follow flag REL are countable 0 0 replyShare Raghav Khajuria commented Oct 15, 2018 reply Follow flag If a set is countable then it is RE ,set of all turing machines are countable i.e RE set So option d is correct which is not RE or uncountable Option c is write because set of all c programs are countable ,means if u start from writing ur first program then u can keep track of it which is the definition of countablity .... 1 1 replyShare Please log in or register to add a comment.