Skip to main content
Computer Science

Return to Question

Rewritten it more clearly, and edited the tags.
Source Link
edit approved Jan 10, 2021 at 6:53
Bader Abu Radi
edit approved Jan 10, 2021 at 6:53
Bader Abu Radi
  • 4.9k
  • 1
  • 11
  • 38

I thought to reduce it to afrom the halting problem but ito conclude undecidability, yet I don't know how orto do it. Perhaps the problem reduces to other decidable problem of, and thus it is also decidable?

I thought to reduce it to a halting problem but i don't know how or other problem of decidable

I thought to reduce from the halting problem to conclude undecidability, yet I don't know how to do it. Perhaps the problem reduces to other decidable problem, and thus it is also decidable?

Became Hot Network Question
Source Link
Paradojin
Paradojin
  • 11
  • 3

Given the Turing machines M1 and M2, is L (M1) = L (M2)? is decidable?

I thought to reduce it to a halting problem but i don't know how or other problem of decidable