Question: Let L 1 be recursive and L 2 recursively enumerable. Show that L 2 - L 1 is necessarily recursively enumerable. Also prove or disprove

Let L 1 be recursive and L 2 recursively enumerable. Show that L2-L1 is necessarily recursively enumerable. Also prove or disprove the statement for L1- L2.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!