Question: I have the following instance of a problem: 2 Turing machines M1 and M2 entered by their codes. And the question is: Does it hold

I have the following instance of a problem: 2 Turing machines M1 and M2 entered by their codes.

And the question is: Does it hold that L(M1) L(M2)?

How do I show that the problem above isnt algorithmically decidable?

Thank you <3

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!