Rice's Theorem (Undecidability): 5 Proofs and Examples 

Nobody is commenting on the thumbnail? Just brilliant, 5 rice bowls and a woman should grab everybody's attention 🤣

Maybe this is a dumb question but how does this make even sense? Non-trivial: Come up with two random turning machines (M_1, M_2), where one is inside the language of the problem and the other is not. Property of TM languages: Make some weird claim about two other random turning machines (X_1, X_2) that have seemingly zero relation to M_1 and M_2 defined prior. By Rice's theorem, problem is undeciable. I could still follow with the non-trivial part, since M_1 and M_2 two had some kind of connection to the actual problem but Property of TM languages is like making some random unrelated statement, so I don't understand how this is supposed to work.

How we need a Rice-Curry Theorem and my life will be complete. Sadly, Rice and Curry never collaborated with eachother.

Yay! thanks man you saved my day and the exam

can you just put the accept state there with no transitions to it?

How can we just say if L(M1) = L(M2) ? Shouldn't we prove it?

Thanks, Boss

Professor, can you tell me how I can reduce epsilon accept problem to acceptance problem?

Consider a set of Turing transducers {T# | T maps epsilon to epsilon} is this decidable or undecidable?

It kills me that you put a hot girl pic to bait people to watch this but tbh it worked on me😆

What's going on with that thumbnail, Easy Theory? Care to explain?

I've been cheated by the thumbnail

RICE: IN SOUTH INDIA WE EAT DAILY.🤪🇮🇳