Turing Machine - Introduction (Part 1)

[@raghavendrasunkollu3198]

I have completed almost 2 and a half years of my engineering referring to your explainations and I have been getting ba great cgpa I'll never forget the instructors way of teaching each and every concepts accurately and precisely I write the same answers in exams and I have got my marks

[@Dcent_K]

I can not believe it. You make everything so simple and don't leave anything to the imagination. Wonderful explanation!

[@antarakmit4114]

Fck you...don't believe...but don't waste comments space

[@debaditya66]

@@antarakmit4114 tf

[@zackcarl7861]

Magic of an indian teacher i guess 😆 they explain so good each time

[@drummaboy2346]

I am in online school for computer science and these videos are very well explained. Trying to picture the turing machine in my head and trying to understand it is well beyond my grasp. Thank you for these videos.

[@SIMPLEFBB]

Sir, you are the best in what you do ! Please keep it up! You have helped thousands of people with all your videos ! I thank you from the bottom of my heart :)

[@shiroangel6510]

thank you I had studying all the course from your channel 😍😍

[@danny9131]

Very simple and lucid explanation of a very tough subject. I am confident that I am going to pass tomorrow. Thank u Neso Acdemy.

[@stevegreatt]

Did you pass on that day?

[@supp1084]

He failed guys , he is currently working in Mac Donald’s in my town. I see him everyday and he told me that he failed by 2%

[@saurabhinnovative4025]

Read the name after failingvhe joined isis

[@NaveenreddyYNR]

@@supp1084 😂

[@shivamxsingla]

@@supp1084 😂😂😂

[@Gautamabharwal]

Bacha lia bhai. Watched the entire automata playlist from dfa to turing machine. Not sure if I'll pass or not. But atleast now i easily know what automata and its languages are. Thanks man!!

[@c.r.i.o.g.b.o.i8523]

did u pass?

[@muradz.9473]

You passed or still dealing?

[@Gautamabharwal]

@@muradz.9473 bhai back agai thi. fir clear karli . ab to passout hogaya degree b last year agai thi 😂😂

[@muradz.9473]

@@Gautamabharwal dude I prefer English , I dont know your language

[@jellyadi1070]

@@muradz.9473 he is telling that's long back he took the exam ,now he graduated .

[@instant_mint]

I found this very clear and helpful. The repetitions of words and explanations work very well with me and help me understand better.

[@yashjadhav3974]

tomorrow exam speed *2 lets goooo

[@muradz.9473]

Did you pass?

[@D4e5v2i6l4]

Passed?

[@disagiato9391]

​@@D4e5v2i6l4 He left the university and start a business online

[@Taha_Sumeer]

Real.

[@MikasaAckerman-oz1hd]

2 years have passed but people doesn't change 👀 exam tommorrow watching in 1.75x speed

[@varunbeekanvk2417]

The presentation is so neat and clear. The explanation is so effective by NESO academy.

[@surajsakpal505]

It is really an awesome series of lectures. Just watching from morning n almost abt to complete all lectures now. Got the whole information of the subject in a very easy way. Thank you so much sir. 😊🙏

[@deekshad5491]

Thank you sooo much. Your explanation is so very clear and unambiguous.

[@thorisomolefe2276]

Thank you sir for these videos. They are amazing and extremely well explained.

[@albinsopaj]

He should have mentioned that the Turing Machine tape is infinite in both sides. And when it starts reading the tape, in the initial configuration all symbols to the left of the symbol which is being read by the TM head are blank symbols. Because TM reads left to right, when it reads the first character from the input string all characters to the left of the first character are said to be blank, denoted by an asterisk * or a 'b'.

[@purvagaikwad548]

best explanation sir.kudos!!

[@aniktahabilder2518]

Very informative neat and clean explanation.

[@dhruvsharma5786]

Sir ji dill se dhanyawad ❤❤🎉🎉❤

[@vladimirfokow6420]

Very well explained - thank you!

[@nepalcodes5]

Introduction to Turing machines 00:01 Overview of previous topics - finite state machines and pushdown automata Comparison of languages accepted by finite state machines and pushdown automata ✦ Turing machine is more powerful than finite state machines. 00:57 Turing machine is more powerful than finite state machines and pushdown automata. Turing machine accepts recursively enumerable languages and has a different data structure compared to finite state machines. ✦ Pushdown automata is more powerful than finite state machines due to the presence of a stack. 01:57 The presence of a stack in pushdown automata gives it more power than finite state machines. The class of languages accepted by pushdown automata, known as context-free languages, is higher than regular languages. ✦ Turing machines are different from finite state machines due to the use of a tape as a data structure. 02:51 The tape in a Turing machine is an infinite sequence of symbols, with a tape head positioned on the current symbol. The tape head can move one step left or right, and input symbols are filled into the cells of the infinite sequence. ✦ Turing Machine uses a special symbol known as the blank symbol. 03:56 The blank symbol is not part of the tape alphabets or input symbols. It is used to fill the infinite tape's empty cells. ✦ Turing machine has an infinite tape and a tape head 05:00 The tape head is the position of the current control Empty cells are filled with a special symbol called the blank symbol ✦ Turing machine tape head operations 06:02 Tape head represents current control position for reading or writing symbols. Operations include scanning and updating symbols below the tape head. ✦ Turing machine operations 07:02 You can move the tape head one step left or right.

[@nepalcodes5]

00:01 Introduction to Turing machines 00:57 Turing machine is more powerful than finite state machines. 01:57 Pushdown automata is more powerful than finite state machines due to the presence of a stack. 02:51 Turing machines are different from finite state machines due to the use of a tape as a data structure. 03:56 Turing Machine uses a special symbol known as the blank symbol. 05:00 Turing machine has an infinite tape and a tape head 06:02 Turing machine tape head operations 07:02 Turing machine operations

[@ankush_in_sync5998]

Thank you sir, i love you

[@adasgggggfs]

Nice explanation. Thanks sir :)

[@prajwalrbhat7853]

Very nice explanation.

[@dayalkawariya5700]

pray for me tomorrow is my exam and now i am learning concepts🥲😅

[@YashRaj-jr7lh]

Bhai kaisa gya lmao?

[@dayalkawariya5700]

@@YashRaj-jr7lh acha gaya

[@sravanimetupally0212]

😂 now my situation also

[@shivaish4355]

Hua ka pass

[@hgraphicspro]

great videos, loved it

[@narendraparmar1631]

Thanks Neso Academy😊😊😊😊

[@Detective1996-Shams]

Nicely explained ,thank you sir.

[@ridwannana-yawamoako2939]

Second comment. congrates!!!.You are a life saver.

[@Aimanofficial-mt8sn]

Tomorrow exams watching at 2 speed 🚄 great lecture

[@poojachaudhari6292]

Nice explanation..I understand very clearly... Thanku sir

[@just_exist_ezz]

exams in 2days *2 lets go great video thanks

[@marvinotieno2194]

Simple and clear, amazing....

[@harshalingle9950]

Nice explanation thanku sir

[@arunagunthapalli3976]

Good explanation

[@pratoshkumarjha89]

Sir please complete your video series on Power system, it'll be a great help.

[@DnyaneshwarPanchaldsp]

nice presentation

[@kurumallas]

Very nice sir

[@ProfessionalTycoons]

very simple explanation

[@RahulBharti02]

Exam after 20 minutes

[@suuj.1]

Good luck 👍🏽

[@etiennnelacroix4653]

It can move to the left or right but more than one step at a time as far as i know; moving one cell is just as an example correct?

[@chsankar]

I have not seen the CSL and LBA in this series. Any reasons?

[@Gamer-ek5pz]

Nice video tq sir ..

[@ProfBeckmann]

thanks!

[@dhanushsivajaya1356]

Thankyou sir

[@sushrithkumar7494]

me badiya tu bhi badiya

[@AhamedKabeer-wn1jb]

Thank you..

[@AbuSayed-gy5mj]

Mandatory to learn FSM or PDA before learning TM? Please answer

[@RenderRift]

I have exam tomorrow 😢

[@takoyaki-sama6337]

do we assign tape head by ourselves or is it given to us?

[@williamhuang5329]

Hanzhen harmonic drive gear , strain wave reducer, robot gear , over 30 years experience

[@LHM1226]

When I see the circles and the word "language" I thought of Chomsky Hierarchy, is it exactly the same idea?

[@bawol-official]

Its a cold abstraction of what language “cant say” as opposed to the logical positivism that gained mainstream popularity in the mathematical community in the early 1900’s. Turing using Godels Incompleteness proved that even a computer with unlimited resources and time will not undo a paradox. The paradox is infinite just the same as the Turing machine. The only way a Turing machine could theoretically solve the halting problem is for it to exist beyond infinite time which is an entirely different can of worms.(Quantum mechanics)

[@sshahidmalik97]

LBA linear bounded automata lectures?

[@qulmon32414]

thanks for carrying me to a B

[@ogbuddha7835]

What is the play list for all these topics

[@nesoacademy]

kzbin.info/aero/PLBlnK6fEyqRgp46KUv4ZY69yXmpwKOIev

[@maqsood.ahmad999]

When to chage states?

[@sharathsooryat1755]

What is the editor used by you sir?

[@shashwathsk6880]

do watch kgf2 teaser...its next level

[@Er.meghajain]

Why do din't make the video about LBA ?

[@HypotheticallSpeaker]

12 hours for the exam

[@r.r.kreddy5603]

How input string can be data structure ...can anyone help me out???

[@hellloooworld1124]

Hola, for all unileeds guys.

[@saitejapln3191]

Watch imitation game movie ...u will know who actually Turing is....

[@bubbletea8793]

@3:02

[@PWMoze]

But come on....Turin had hoped it could be used for free porn, didn't he? In fact he considered the whole enterprise a failure because you couldn't access Pornhub with it.

[@sghqz]

Tf

[@nieschalghosh4702]

Where is context sensitive grammar.

[@marthaclements9289]

heart

[@MG-qu9ig]

1st view & 1st comment.!

[@peacefulmusicvideos9036]

calicutt university kar undo

[@nazeemck3987]

Present sir :D

[@Vesper007_]

I like lamas

[@darrienmolvig4972]

ajr

[@movex_rusticvault]

Timmorow morning sem exams let's go now 11:30 time