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
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
Copyright © 2021 JogjaFile Inc.
Unfortunately, this problem is undecidable! See: Rice's Theorem.