Prove A = { | M and M' are Turing machines and L(M) ∩ L(M') is empty } is not decidable.
Posted: Fri May 20, 2022 5:33 pm
Prove A = { | M and M' are Turing machines and L(M) ∩ L(M') is
empty } is not decidable.
empty } is not decidable.