0 votes 0 votes Let $M_1$ and $M_2$ be arbitrary Turing machines. Show that the problem $“L(M_1)\subseteq L(M_2)”$ is undecidable. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation decidability proof + – Rishi yadav asked Mar 16, 2019 Rishi yadav 227 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.