0 votes 0 votes Theory of Computation theory-of-computation decidability + – Na462 asked Jan 21, 2019 Na462 713 views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments Shobhit Joshi commented Jan 21, 2019 reply Follow Share $M$ is reducible to $L$, so $M$ can be recursive enumerable. So, $M\bigcap L$ is not recursive always. Correct me if i'm wrong. 1 votes 1 votes Na462 commented Jan 21, 2019 reply Follow Share See we get that L is R.E.L and may or may not be Recursive though Now if M <= L (Say L i assumed as Recursive) then M will also be recursive then : M intersection L = Recursive intersection Recursive = Recursive If I assume L as Recursively enumerable but not recusive and M is reducible to L them M can be recursive So M intersection L will be Recusively enumerable not recursive 1 votes 1 votes Magma commented Jan 21, 2019 reply Follow Share thanks 1 votes 1 votes Please log in or register to add a comment.