karruro6 karruro6 21-05-2024 Computers and Technology Answered Let Σ = {0, 1}. Define the language L0000 = { ⟨M1,M2⟩ | M1 and M2 are deterministic Turing machines, and L(M1)∩L(M2) contains only the string ‘0000’ }. Show that L0000 is an undecidable language.