Turing Machine - Introduction (Part 1)

TOC: Introduction to Turing Machine
Topics Discussed:
1. Brief recap of the FSM and PDA
2. Introduction to Turing Machine
3. Tape of Turing Machines
4. Operations on the Tape

Music:
Axol x Alex Skrindo - You [NCS Release]

[raghavendrasunkollu]

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!

[shiroangel]

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

[drummaboy]

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 :)

[danny]

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

[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!!

[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.

[deekshad]

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

[varunbeekanvk]

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

[surajsakpal]

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. 😊🙏

[thorisomolefe]

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

[aniktahabilder]

Very informative neat and clean explanation.

[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'.

[nepalcodes]

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

[ridwannana-yawamoako]

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

[poojachaudhari]

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

[nepalcodes]

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.

[dayalkawariya]

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

[Aimanofficial-mtsn]

Tomorrow exams watching at 2 speed 🚄 great lecture