Question: You may describe algorithms informally, as long as your description is clear and complete. No need to give programs or Turing machines. (20%) Let L,

You may describe algorithms informally, as long as your description is clear and complete. No need to give programs or Turing machines.

You may describe algorithms informally, as long as your description is clear

(20%) Let L, K-{0, 1)' be disjoint languages. (a) Give an example where L, K are both undecidable, and their union is decidable. (b) Give an example where L, K are both undecidable, and their union is undecidable. (c) Show that if L is decidable and K is undecidable, then LUK must be undecidable

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!