Why is it not possible to prove that two Turing Machines calculate the same function?

cs.stackexchange https://cs.stackexchange.com/questions/114815

Frage

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?

Keine korrekte Lösung

Lizenziert unter: CC-BY-SA mit Zuschreibung
Nicht verbunden mit cs.stackexchange
scroll top