Well explained! Much better than my teacher! Thanks for the video! 😉
@yichu1052
9 жыл бұрын
The clearst explanation I have ever found! Thank you very much
@RedReality13
6 жыл бұрын
You're a wizard, Harry.
@mayanksinghyt
9 жыл бұрын
thank you Mr. Harry Porter
@onieltoledo8019
9 жыл бұрын
This is a really helpful and easy to understand explanation, thanks for the upload!
@alingurcuti
9 жыл бұрын
oooh thanks God i tought i will never find someone who`ll give a proper example for this
@basheeral-momani2032
8 жыл бұрын
thank you dr. clear and simple example
@alibaba-yf8ur
Жыл бұрын
I think the last machine accepts a string of form 0^n1^m if n > m, when it shouldn't
@pratb96
8 жыл бұрын
Thank you so much Sir this video and all the others as well are brilliant!
@CocoonBloom
9 жыл бұрын
This is what I was looking for! Thank you!
@sharifabahar6257
8 жыл бұрын
perfect , it helps me a lot . Thank you
@antenehyeshiwas3471
8 жыл бұрын
u save my life thank you
@masterdaweb1
9 жыл бұрын
Very nice professor, thank ya
@arubio277
7 жыл бұрын
Very well explained. Could you please consider uploading a better quality (HQ or HD) video? Thank you.
@zramdeen
3 жыл бұрын
Thank you.
@CarlBrusell
5 жыл бұрын
It's really a great class, unfortunately it's only available in 240p.
@mgeorgescu
5 жыл бұрын
Best part, no thick hindi accent
@TVIDS123
8 жыл бұрын
The last diagram has a slight bug. _1 is accepted, as a space at start allows it to reach the accept state.
@MrWhale1
8 жыл бұрын
+Tommy Preston A space always indicates the end of the input because the input alphabet does not include blank space.
@TVIDS123
8 жыл бұрын
Ah thank you!
@aizaimran947
10 ай бұрын
Could you scan your notes that you use for each video and upload them all somewhere? It would be so convenient to review for exams.
@Frango26
9 жыл бұрын
great explanation =D
@hasmituchil5214
9 жыл бұрын
Thank you!
@pleasurengobeni985
9 жыл бұрын
Thanks this was well explained, been searching for something like this. Do you have something on 2-Stack PDA and also Computable Functions using Unary encoding?
@Ahmed-vd3dd
7 жыл бұрын
Thanks man
@Huseynlkin
9 жыл бұрын
Thank you for a great tutorial. I have a question, at first example what happens if a blank space comes after 00? Isn't there one more state between B and C?
@tareqmohammed24
8 жыл бұрын
Thank you, a lot!!!!!!
@mikkiwhistler7769
7 жыл бұрын
can you do a quick demonstration of turing machine solving the element distinctness problem? please? this one I find confusing to read through and understand
@shinobicro
8 жыл бұрын
if language is L=01*O, this means,beacuse of 1* (zero, one of multiple times 1) that we can enter 0>nothing
@obnx7
8 жыл бұрын
+shinobicro 0(nothing)0 means input is "00" ... first 0 will take the machine from state A to state B, second 0 will take from state B to state C .. then Null character .. meaning ACCEPT
@TheNoisyOyster
8 жыл бұрын
+Anurag Rai You mean epsilon, not NULL.
@aaronweiss3294
5 жыл бұрын
Zero is not nothing. Try calling a 1-800 number and leaving out the zeroes because they mean nothing
@aisha_pri
8 жыл бұрын
Thank you,so much Sir!! very well explained :D
@dafemartdafemart4020
7 жыл бұрын
thanks potta
@troopedd71542
4 жыл бұрын
very good video! But to me it is much more tedious to represent turing machines with nodes likes this rather that using the transition functions lol
@hak4fak
7 жыл бұрын
I guess I'm too stupid ,not getting a thing,stuck in first example
@justjake536
8 жыл бұрын
Thanks for the helpful video! I didn't realize you were a professor now, Harry Porter, I always figured it would be Hermione. :)
@mycloud3138
8 жыл бұрын
This machine had one bug and I've fixed it. If you are interested in the complete Java code simulating this machine, you can find it on my Github github.com/MyCloud012/Turing-Machine
@affanalim
6 жыл бұрын
Sir, it will accept YYYY... = Y* , what do you think?
@vikashraj2561
7 жыл бұрын
sir i want your help for exam plz give email id to send some question plz hepl sir my exam is 7 july 2017 .only 4 numerical probleam plz sir
Пікірлер: 47