Please give a clear and well-elaborated answer if you choose to asnwer this, please :) Question 3

Please give a clear and well-elaborated answer if you choose to asnwer this, please :)

 

Transcribed Image Text:

Question 3 Prove that the language L given by L = {(M') | every input x is accepted by TM M' or M' diverges on it } is undecidable. For example, if M is the TM that accepts every string of Os and 1s of even length and that diverges on every string of Os and 1s of odd length, then (M') L. Question 3 Prove that the language L given by L = {(M') | every input x is accepted by TM M' or M' diverges on it } is undecidable. For example, if M is the TM that accepts every string of Os and 1s of even length and that diverges on every string of Os and 1s of odd length, then (M') L.