0 0 votes If total turing machine is a proper subset of turing machine then why recursive language is not a proper subset of Recursive Enumerable ? Theory of Computation turing-machine theory-of-computation recursive-and-recursively-enumerable-languages + – Mk Utkarsh 3.3k views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments Mk Utkarsh commented Nov 26, 2017 reply Follow flag (Source: geeks for geeks) 0 0 replyShare junk_mayavi commented Nov 26, 2017 reply Follow flag bro, if some language is in Recursive, then it should also come in recursively enumerable. this comes from their definition. Intuitively, any language for which a TM is present is recursively enumerable. in that way, the set of recursive languages is also RE. Is this what you asked in question? that geeksforgeeks says R is a subset of RE, well it is proper subset also. 0 0 replyShare Mk Utkarsh commented Nov 26, 2017 reply Follow flag it is proper subset not subset 0 0 replyShare Please log in or register to add a comment.
0 0 votes there are some language which are RE but not RECURSIVE so definitely R is proper subset of RE abhishek tiwary answered Nov 26, 2017 abhishek tiwary comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes recursive language is proper subset of recursive Enumerable language . look at the chomsky hierarchy. abhishekmehta4u answered Apr 23, 2018 abhishekmehta4u comment Share Follow 0 reply Please log in or register to add a comment.
