Question: Use reduction to prove that the language L = {(M1)(M2) : L(M1) L(M2)} is not decidable (M1andM2are Turing machines, of course).
Use reduction to prove that the language
L = {(M1)(M2) : L(M1) L(M2)}
is not decidable (M1andM2are Turing machines, of course).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
