Lecture 24/65: Turing Machine Examples

[@yichu1052]

The clearst explanation I have ever found! Thank you very much

[@GautamKabiraj96]

Well explained! Much better than my teacher! Thanks for the video! 😉

[@RedReality13]

You're a wizard, Harry.

[@mayanksinghyt]

thank you Mr. Harry Porter

[@alibaba-yf8ur]

I think the last machine accepts a string of form 0^n1^m if n > m, when it shouldn't

[@alingurcuti]

oooh thanks God i tought i will never find someone who`ll give a proper example for this

[@onieltoledo8019]

This is a really helpful and easy to understand explanation, thanks for the upload!

[@arubio277]

Very well explained. Could you please consider uploading a better quality (HQ or HD) video? Thank you.

[@basheeral-momani2032]

thank you dr. clear and simple example

[@TVIDS123]

The last diagram has a slight bug. _1 is accepted, as a space at start allows it to reach the accept state.

[@MrWhale1]

+Tommy Preston A space always indicates the end of the input because the input alphabet does not include blank space.

[@TVIDS123]

Ah thank you!

[@zramdeen]

Thank you.

[@CocoonBloom]

This is what I was looking for! Thank you!

[@pratb96]

Thank you so much Sir this video and all the others as well are brilliant!

[@aizaimran947]

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.

[@antenehyeshiwas3471]

u save my life thank you

[@Huseynlkin]

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?

[@pleasurengobeni985]

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?

[@masterdaweb1]

Very nice professor, thank ya

[@CarlBrusell]

It's really a great class, unfortunately it's only available in 240p.

[@mgeorgescu]

Best part, no thick hindi accent

[@sharifabahar6257]

perfect , it helps me a lot . Thank you

[@mikkiwhistler7769]

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

[@Frango26]

great explanation =D

[@troopedd71542]

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

[@shinobicro]

if language is L=01*O, this means,beacuse of 1* (zero, one of multiple times 1) that we can enter 0>nothing

[@obnx7]

+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]

+Anurag Rai You mean epsilon, not NULL.

[@aaronweiss3294]

Zero is not nothing. Try calling a 1-800 number and leaving out the zeroes because they mean nothing

[@hasmituchil5214]

Thank you!

[@justjake536]

Thanks for the helpful video! I didn't realize you were a professor now, Harry Porter, I always figured it would be Hermione. :)

[@affanalim]

Sir, it will accept YYYY... = Y* , what do you think?

[@dafemartdafemart4020]

thanks potta

[@Ahmed-vd3dd]

Thanks man

[@tareqmohammed24]

Thank you, a lot!!!!!!

[@hak4fak]

I guess I'm too stupid ,not getting a thing,stuck in first example

[@mycloud3138]

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

[@aisha_pri]

Thank you,so much Sir!! very well explained :D

[@vikashraj2561]

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

[@MccZerk]

Looks like a good video, too bad its 240p