Turing Machine (Example 2)

[@snehitvaddi]

Neso Academy----The Savior of Nights Before Exam ✌✌✌✌😂😂

[@utkarshp1108]

Tomorrow is my toc exam 😭 this is lit

[@10subsonlychallenge66]

Tmrw is my TOC exam. Wish me good luck. Sleep less nights. If you guys see this message pls do reply to this, I will see the comment which will later bring me nostalgic feels

[@mohammedafzal4343]

Literally 💯

[@aymanrahman4118]

@@10subsonlychallenge66 how did the exam go?

[@10subsonlychallenge66]

@@aymanrahman4118 hello mate thanks for the reply I passed TOC and got S grade I completed my clg and now i am gonna work at Amadeus Bangalore as a SDE from coming January 🙂

[@OwzaB]

I love how you quickely address questions that seem to be contradicting after you introduce a new concept, I be like, "wait! didn't you just say..." and 10 secs later I'll hear you say "Now you might be asking why did we do this when I said we can't". Awesome videos man. Been watching for tha past three months.

[@DoctorWarlock_]

I agree. To me, that's usually the mark of a great and talented teacher 👌

[@jideplumptre]

I can't imagine what the people in 2016 and earlier had to go through without this channel

[@ravneetsingh1922]

literally helped me to cover the whole syllabus one night before the exam kudos to neso

[@miteshshetty6600]

did u pass?

[@Kpk-11]

@@miteshshetty6600 🤣😂😂

[@theether5482]

@@miteshshetty6600 🤣🤣🤣🤣🤣🤣🤣🤣

[@CHOPPARAPUSAISREEKAR]

us bro us

[@mohammedafzal4343]

I've my TOC exam in 2 hrs and here I am learning the concepts in the best way possible. Thanks Neso Academy!

[@042_md.shabuktahaidereric8]

how was the exam dude? c:

[@mohammedafzal4343]

@@042_md.shabuktahaidereric8 I did it well brother!

[@042_md.shabuktahaidereric8]

@@mohammedafzal4343 Barakallah..

[@quantumscapegoat]

I am studying CS at one of Australia's best colleges, and yet the cant teach as good as you and the few amazing youtubers out there. I believe this entire education system is flawed... I mean atleast you dont need to go to a college to study something like graphic designing or CS.... or rather something which requires techincal skill. Ofcourse colleges are important for medical sciences. back to the topic - brilliant video and great explanation.!

[@mohamedcamara4985]

I did'nt understand the turing machine before but, by watching your videos i have understood it very well. thanks so much . you're fantastic explainer

[@suchitragiri4546]

NESO_Academic is the best youtube channel all doubts are cleared and explain everything about the topic. I like very much the way of teaching👍

[@sajaldebnath2117]

I did'nt understand turing machine before but, by watching your videos i have understood it very well. thanks so much. Your voice and background was clear. Over all this learning was awesome.

[@ayushsharma397]

awesome work u guys,free lectures of this much excellence level is rare .thank you so much man.

[@dwarkeshbhayani6525]

The background of your video and clearity of your speech forces me to see your videos keep making it 👌

[@saranyapandey]

true

[@GitaGhasemi]

I read Peter Linz' book and still had some problem understanding the turing machine. Thank you so so much for explaining it this easy! It's 3am, I'm so sleepy and have my final exam at 11am, yet I totally got what you did. :D Thank youuu

[@Eyezick-l5z]

Thanks for filling in for my prof! I don't think people like you truly realize the level of help that you provide. Wish you all the best

[@Durgakhanal1]

Learned a lot more than being in the class. Thanks to Neso Academy..

[@DoctorWarlock_]

Big love. These tutorials are all I need to pass my AT class fr. Tyvm

[@cipher7565]

This is a really good tutorial. Thank you for making a detailed walk-through of a TM!

[@zenryuu7182]

wow! this is much simpler then how my professor taught this in class! Made assignments so much easier! I'd rather be paying people like you these University fees than my professor...

[@dedicatedtoinspirators]

You explained it like anyone who doesn't know the basic idea about Turing Machine can also understand and learn... Thank you

[@RespondeadGaming]

I got mind blown on this tutorial, It's amazing the way I understand each process, thank you for making this amazing tutorial

[@boringmangesh]

Had my end sem exam Today, Started preparing yesterday, in 1 day covered almost all the topics and I think I'll score good as I solved all the questions. Thank u so much Neso, can't thank you enough!

[@shivaish4355]

Kaisa hua

[@boringmangesh]

@@shivaish4355 bhai out of 60 mein ne 54 score Kiya Tha.

[@shivaish4355]

@@boringmangesh tips bata bhai koi mera compartment ka exam h

[@prakritighamal]

I always feel thankful towards you whenever I watch your video. Kuddos to your hardwork.

[@DuckSenseTV]

Thanks for making the life of thousands of students much easier. Respect!

[@travel_with_jimmy_]

Great work sir Always get satisfied when i study from ur lectures..

[@jajnyaseniswain8472]

Amazing video sir.. I got each and every point you explained.. Your way of teaching is really understandable..

[@rahul__jain25]

Every topic is very well defined and it proves helpfl for me during exams.

[@ariel7590]

Thank you very much You explained to me in 13 minutes what I couldn't understand in a 2 hours lecture in college

[@iRapplexD]

thank u so much, good video not only save grades, but it save fellow stem souls!

[@suhhashis]

One of the best available online tutorial

[@sumansuravi617]

It's so helpful and easy to understand. 😊

[@flight-at-the-speed-of-light]

جزاك الله خيرا. شرحك رائع و مبسط

[@AmmarAhmey]

Thank you so much for this awesome explanation :) easy to understand, keep helping us by making such nice videos :)

[@ankitapanjwani6409]

Great explanation everytime👍

[@samiulislamshibly6520]

Love and respect from Bangladesh.

[@dealvin]

thaks, can be repetitive, but you teach excellent and bluntly

[@unaisshaikh3004]

Great Explanation

[@ManishMishra-ke5dl]

Neso academy =lifesaver

[@hritwikadubey3964]

U r just amazing.. Thank you 🌻

[@silviyajoy7842]

Thank u so much. ... u guys made it simple to understand

[@linconkasirowe6335]

Brilliant!!! Neso Academy is the best, you are tool much team. Keep up the good work and maintain the same level of standard and even higher. You are great. Do you offer Online certificates? i need it

[@mohitzen]

Very nicely explained. Thankyou

[@sachinmishra4232]

Really great Explanation.😮😮

[@n07kiran43]

in 10:45 , there is no need of separate D state right, we can loop through y -> y, R at A itself and the B -> B,L transition from A to acceptance state

[@aarceus5389]

The state D is required to prevent strings of the form (0^n)(1^n)(0^m)(1^m) from passing, dry run 0101 and you will see it will pass if you do not have the state D.

[@068_gauravchakraborty]

thx a lot sir

[@lyn8964]

very good viedo!Very helpful to understand , thank you a lot!

[@Daffodil7860]

3 am , night before finals. Neso academy here i come again.... Thankyou ❤️

[@rajashekarreddydasari574]

Soo nice to understand thanks sir for helping.

[@ResulBozburun]

Thank you for the tutorial but if you can also explain "how to design the turing machine" that would be better instead of the "how works the designed turing machine".

[@oguzhanguldibi]

Sen nasil bi kralsin..

[@KrzysiekTannenberg]

Oh my god you explain it so well

[@PremKumar-yz1qm]

This lecture is gold...tq sir

[@__looser__5204]

one night batting full marks with ur lectures thanks sir

[@aichazerouali3208]

thank you it help me so much ;)

[@ameenaboraya2644]

Great explanation

[@ahmadmardeni4699]

You are Amazing!

[@jindagi_ka_safar]

Perhaps no one can explain it better

[@mhamadnazm7588]

Thank you

[@narendraparmar1631]

Thanks a lot sir ji😊👌

[@madhoshyagnik3679]

Thank you, for a great video.

[@DatNguyen-tm2tw]

so good, thank you very much !!!

[@dididudidirua_4596]

super clear! easy to understand

[@nitingiri8326]

Very Helpful

[@shubhamsawlani2933]

bhai bhai neso is saviour

[@ganvigowda2007]

Greatful to u........ 😊

[@foz7422]

Thank u!!!!! Life saver

[@AhamedKabeer-wn1jb]

Wonderfull explanation

[@shivasharma9555]

thaks a lot sir ,very well explained

[@justinthenerd561]

night before midterm, lets gooooo

[@trippingtonproductionsco.7641]

Me too I just smoked some gelato 🍧 rip

[@justinthenerd561]

@@trippingtonproductionsco.7641 Guess wut, Im here again for the final RIP good luck my friend

[@pavitra3819]

@@justinthenerd561 I feel u

[@aydict]

@@justinthenerd561 what about now?

[@justinthenerd561]

@@aydict I did it!

[@louaykhammar7268]

thank you very much sir

[@DnyaneshwarPanchaldsp]

nice lecture

[@hakanyalcn6826]

is the accept state care about that where the head on the tape? if not, why we should "blank->blank, L"? can we use "blank->blank, R"?

[@technicalspecial2770]

I think it does'nt matter that you go left or right once you have completed your string it doesn't matter much

[@suchitragiri4546]

I think both are correct, its totally depends to u that whether u write b->b,L or b->b,R.

[@khashmanalturki1076]

You are incredible good

[@nyx6312]

Bro it’s unfair my exam had only 1 Turing and it was an absolute multiplication not these. Fuck my luck

[@davidorevic6651]

7:11 should we draw "reject" state ?

[@samisit0]

Very excellent explanatory video. Thank you very much! I just have one question. What are the sets Σ and Γ for this particular Turing machine? I could guess that one of them could be {0, 1, x, y} but I don't understand their differences.

[@filipflajsman2027]

Σ = {0, 1} Γ = {x, y} Because Σ is alphabet of the language L and Γ is a set of symbols in the tape

[@marxman1010]

@@filipflajsman2027 Wrong. Σ and blank belong to Γ.

[@feign.8468]

Thanks

[@vishwanthreddyjakka5907]

Thank you so much!!!!!

[@robertbehrens7026]

thanks buddy

[@pinkeshpanchall]

Thank you so much for Your videos

[@rohitrathore5480]

Say i have a string "00010111" which is technically wrong according to {0^n 1^n | n >= 1}, but still the turing machine designed above will accept it right? how or i m making a mistake somewhere

[@aminemarref]

This goes through A,B,B,B,C,C,C,A,B,B,B,B,C,C,C,C,A,B,B,B,B,C,C,C,C,A,D and gets rejected there for encountering 0 on the tape (which is not defined i.e. goes to reject).

[@nikitasinha8181]

Thank u sir 👍

[@codemode8910]

thank you soooooooooooooooooooooooo much

[@bonbonpony]

1. So now the input is part of the tape instead of a separate input? 2. Can this algorithm be performed in a non-destructible manner? (that is, without destroying the original input on the tape by replacing it with Xs and Ys) 3. As defined so far, this Turing machine seems to be only capable of taking some input and accepting it or rejecting. But what about producing some OUTPUT? In order to perform some more useful computation, the computing machine should be able to calculate some results (e.g. evaluating arithmetic expressions) and output them. Can we do that within the current framework? 4. What about PROGRAMMING the machine? Isn't it that we have to make a special machine for every single tast we want to perform with this particular design? Because the program is stored in the "head", as the state automaton, and this automaton has to be replaced by another one in order to change how the machine works.

[@prabuddhakulatunga9091]

Thank you!

[@sreejanagrahari]

I'm so much satisfied.

[@arjung1062]

Thenks

[@naanuyoutuberthanda3545]

Why normal speed is thish much slow and 2x is little slow

[@iamshoooq]

watching this right 4 hours before my final

[@nawabahmed551]

can we have a self loop on A for y - - - ->y , R rather than going into D state and having self loop there?

[@SithumiSamarasinghe]

Changing 0 to X and 1 to Y is a rule? Or can we change it

[@amitmozar184]

can we put the transition for 'A' state for blank -> blank , R and goes to final state?

[@mansijain2250]

Is it compulsory to mention accept state or it can be excluded like reject state?

[@omanjabbar200]

Does this work for 01 (eaching appearing once)? I don't think so. Flawed machine.

[@javierguzman5758]

I love you. 💕

[@nemplayer1776]

In your program, why didn't you just have the transition function δ(A, y) -> δ(accept, y, R)? I'm using "accept" there as the halt and accept state. Isn't that more efficient than going all the way to the right?

[@SwatiKumari-be9yf]

Best one

[@medisaakson5554]

Thank youuuu !!!!!!!

[@rakeshreddyabbireddy8876]

Why can’t if we encounter 1 then we move left continuously and encounter blank for accept state. Here we can save memory for not taking extra space for y. If it is double taped Turing machine.

[@aldricholivar7168]

Can you give an example of a rejected string?

[@filoteserban4816]

0001

[@barbaramatijevic449]

You are awesome!! TnQQ

[@rowdyghatkar]

If we encounter 1 at the very first place what are we replacing it with... I mean I understood it will go to reject state but how will we represent it...