0 0 votes Theory of Computation + – shivanisrivarshini 867 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote If L1 is HALTING problem of TM and L2 is Complement of L1. both L1,L2 are not Recursive. but L = L1 U L2 = Turing Decidable i.e. Recursive. yes Option C is true.. Digvijay Pandey answered Jan 30, 2016 Digvijay Pandey comment Share Follow See all 5 Comments 5 5 Comments reply Show 2 previous comments Arjun commented Jan 30, 2016 reply Follow flag still the same.. 0 0 replyShare Digvijay Pandey commented Jan 30, 2016 reply Follow flag sir, i am taking question is like this "Let a language L = L1 U L2. then which of the following is true ?" :D :D :D 1 1 replyShare Arjun commented Jan 30, 2016 reply Follow flag in that case why not option D? Your reason is correct. But options are grammatically wrong for me- not getting what they mean even after assuming L1 and L2. If one just clean up all these questions GATE aspirants will easily get more marks. 1 1 replyShare Please log in or register to add a comment.
