2 votes 2 votes Explain please. Answer given is D Theory of Computation theory-of-computation decidability + – Anmol_Binani asked Jan 2, 2018 Anmol_Binani 662 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Shubhanshu commented Jan 2, 2018 reply Follow Share If you take Recursive, then also it will remain undecidable because even though Recursive is closed under intersection but its emptiness property is undecidable. 1 votes 1 votes Learner_jai commented Jan 2, 2018 reply Follow Share ty Sir,you are right,I am trying to understand undecidability. 0 votes 0 votes Learner_jai commented Jan 3, 2018 reply Follow Share Sorry sir,I am wrong tm is re language and thanks for guiding 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes okay my answer is UNDECIDABLE see,L1 is undecidable as EMPTYNESS problem is always undecidable now,L1 is redusing L2 soo as L1 is UD what ever languages it reduces those also becomes UD soo L2 is UNDECIDABLE suryaprakash answered Jun 1, 2018 suryaprakash comment Share Follow See all 0 reply Please log in or register to add a comment.
