Why is it not possible to prove that two Turing Machines calculate the same function?
-
06-11-2019 - |
Question
I was wondering why it is not possible. Is it because the corresponding language is not decidable, or because of the fact that it is not guaranteed that a Turing machine halts on every input?
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange