Equivalence for Turing Machines is Undecidable

[@EasyTheory]

Thanks to my supporters Yuri, vinetor, Ali (UA-cam) and Bruno, Timmy, Micah (Patreon) for making this video possible! If you want to contribute, links are in the video description.

[@christianyang6816]

Since UA-cam removed dislike count, it is harder to find gem like this, thanks for the great video! don't be discouraged by the low likes and views if you plan to watch!

[@ar3568row]

Best channel for theory of computation

[@Czeckie]

I wonder about the other direction. If I had an Emptiness oracle, could I solve the Equivalence? What if I had Halting oracle, could I solve the Equivalence?

[@Gabriela-uz8gg]

So do I understand corectly that since ETM can not decide if a language is empty or not => the TM E can also not decide EQTM?

[@MrTeen-ul7yc]

That's right

[@camrws]

did we just show the E_TM reduces to EQ_TM? and because E_TM is undec then EQ_TM is too?

[@vaastavarora7992]

Yes sir

[@dreadknot66]

If L(M1) != L(M2), what would be the decidabliltiy in that case?

[@lo8885]

Big thank you, everythink about undecidability became clearer in my head , Sub +1

[@AkashKumar-lr6hc]

Thanks a lot