0
$\begingroup$

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

$\endgroup$
0

1 Answer 1

Reset to default
1
$\begingroup$

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

$\endgroup$
3
  • $\begingroup$ Is there a way to prove it without using Rice's Theorem? Thanks. $\endgroup$ Commented Nov 26, 2015 at 18:26
  • $\begingroup$ Try this thread! $\endgroup$ Commented Nov 26, 2015 at 18:28
  • $\begingroup$ Thank you! I answered the thread, can you check if my approach to solve the problem is correct? $\endgroup$ Commented Nov 26, 2015 at 18:41

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.