Intersection of Turing Machines Languages

1.3k Views Asked by At

Given a Turing Machine A and a Turing Machine B, how can I know if the intersection of the Languages of both Turing Machines is non empty?

L(A) $\cap$ L(B) $\neq$ 0

1

There are 1 best solutions below

3
On

Unfortunately, this problem is undecidable! See: Rice's Theorem.