Great explanation of proof of Rice's Thereom. Can you also post a walk-through example using Rice's Thereom to show a particular problem is unsolvable? I have a hard time applying it...
Hello, sir. You content is great, if you make some thumbnails, edit titles and cover, edit video to speed up some writings, your channel will go to next level.
At 4:50 he said "there are finite no. of languages that have 1000 strings". But even for a unary alphabet £={a} we can generate infinite no. of strings. Hence the no. of languages with 1000 strings in them will be infinite. Who's wrong and where?🤔
A_TM is a language where A_TM = { | M is a TM and M accepts a string w} it is a theorem in which we showed that A_TM is undecidable. We use this theorem to prove undecidability for others.
thank you india!!
your welcome
that video was really well explained, finally I understood this throrem
Great explanation of proof of Rice's Thereom. Can you also post a walk-through example using Rice's Thereom to show a particular problem is unsolvable? I have a hard time applying it...
Please check out NPTEL. He is a professor of IIT. You'll find everything for free in NPTEL.
Sir I have seen your other videos, u are excellent. Everything u teach will reach students clearly. Thank you sir. I Have subscribed 👍
Great Explanation Sir
Hello, sir. You content is great, if you make some thumbnails, edit titles and cover, edit video to speed up some writings, your channel will go to next level.
you are the goat
super nice handwriting
At 4:50 he said "there are finite no. of languages that have 1000 strings". But even for a unary alphabet £={a} we can generate infinite no. of strings. Hence the no. of languages with 1000 strings in them will be infinite.
Who's wrong and where?🤔
nice point,
nptel should answer this
Koi baat ni, galti ho gai hogi londe se :)
The statement means that if we take the set of all languages over a particular alphabet, only a finite number of them will have exactly 1000 strings.
Which is absolutely wrong.
@@manishsemwal5 How do you disprove it then?
very educative! thank you
Nice explained
Great explanation !!!
Amazing explanation, thank you!! Helped me a lot!
super explain sirr easily understand
simplicity at its best
i m still stucka t reduction i cant understand reductions
You lost me at A T M. I wish you'd given a hint what this A T M was.
A_TM is a language where A_TM = { | M is a TM and M accepts a string w} it is a theorem in which we showed that A_TM is undecidable. We use this theorem to prove undecidability for others.
ATM is Non Deterministic Turing Machine
its like a universal tm
Atm is automatic teller machine, if you have no money in the bank its undecidable
@@erlindaalba1682 😂😂😂👏
U r going too slowly.. keep covering all things in short time
Why he is so dull it looks like he is not interested in teaching