that video was really well explained, finally I understood this throrem
@delrocco
5 жыл бұрын
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...
@sauravdeb8236
3 жыл бұрын
Please check out NPTEL. He is a professor of IIT. You'll find everything for free in NPTEL.
@moviesnight248
4 жыл бұрын
Sir I have seen your other videos, u are excellent. Everything u teach will reach students clearly. Thank you sir. I Have subscribed 👍
@ahalyasubramanian2315
3 жыл бұрын
Great explanation !!!
@aydinahmadli7005
4 жыл бұрын
very educative! thank you
@ViceroyoftheDiptera
3 жыл бұрын
super nice handwriting
@jegan2576
5 жыл бұрын
super explain sirr easily understand
@himanshusharma-lt3zg
6 жыл бұрын
simplicity at its best
@vikaschauhan6442
4 жыл бұрын
Nice explained
@Linaiz
4 жыл бұрын
Amazing explanation, thank you!! Helped me a lot!
@anarabiyev9766
7 ай бұрын
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.
@ikramwani5207
Жыл бұрын
i m still stucka t reduction i cant understand reductions
@JakeSilver26
2 ай бұрын
you are the goat
@manishsemwal5
5 жыл бұрын
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?🤔
@MOHITSINGH-lx6by
4 жыл бұрын
nice point, nptel should answer this
@manishsemwal5
4 жыл бұрын
Koi baat ni, galti ho gai hogi londe se :)
@GokulNathXYZ
4 жыл бұрын
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.
@manishsemwal5
4 жыл бұрын
Which is absolutely wrong.
@GokulNathXYZ
4 жыл бұрын
@@manishsemwal5 How do you disprove it then?
@mysmallcap
5 жыл бұрын
You lost me at A T M. I wish you'd given a hint what this A T M was.
@shtephl354
5 жыл бұрын
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.
@saurabhdalakoti6099
5 жыл бұрын
ATM is Non Deterministic Turing Machine
@ssjxn
5 жыл бұрын
its like a universal tm
@erlindaalba1682
4 жыл бұрын
Atm is automatic teller machine, if you have no money in the bank its undecidable
@mars-kw8xo
4 жыл бұрын
@@erlindaalba1682 😂😂😂👏
@karthi2111
5 жыл бұрын
U r going too slowly.. keep covering all things in short time
@techdreams6748
3 жыл бұрын
Why he is so dull it looks like he is not interested in teaching
Пікірлер: 33