And where in the definition of rules of operation of TMs does it state that we can arbitrarily add dots ? The rules state that we can only update a cell using the defined alphabet or a blank. How does one write both a 'dot' and a character of the alphabet?
I guess what we can do is assign special characters for a and b when the tape head is supposed to be there. Say we assume that if the tape head is present on a, it should be represented by '?' and when on b , it should be represented by '!'. In this way when we encounter a ' ?', or a '!' on the tape, we will know that it is the position of the tape head and also we will know what is the actual symbol present there; a or b
at 11:45 you say you discussed "marking" in "just the previous lecture", but which lecture are you actually referring to? I don't recall you mentioning "marking" in Turing Machine Programming Techniques (Part 3)
It is indeed explained in that video towards the end, where you map every letter to a unique letter so that you can reconstruct the string after all the operations.
How can the Turing machine remember the symbols which have dots below them, before deciding which transition to take? It has to have another tape to store this information.
not really, it may be a little misleading for him to omit that but we just define new symbols for all symbols used, so for every "symbol" (e.g. a, 1, x) we define a "symbol dot" which is only used to remember where was the head in every part of the machine and yes defining arbitrary symbols outside of present symbols to help us is fine
I am guessing you are in computer science or related fields? Turing machine is the base of computer science and if you can't bear to watch it just drop out please. We need less idiots like you in computer science. Thanks.
Why are those lectures soooooo repetitive? ;o You repeat the same sentences over and over ad nauseam. So basically we use a single-tape TM to simulate the execution of a multi-tape TM? For the transition function, how about taking each possible combination of the three symbols and assigning them a single symbol? Then it would became a transition function for just those single symbols.
![Blox Fruits Dragon Rework Update [Full Stream]](http://i.ytimg.com/vi/EqDAp8udhm0/mqdefault.jpg)
Sir, you are a HERO. You made a complex problem into the easy problem. Thank you so much
Happy teacher's day . Tomorrow is my end semester 🎉
All the best 👍
👍
Thanks Neso Academy
And where in the definition of rules of operation of TMs does it state that we can arbitrarily add dots ? The rules state that we can only update a cell using the defined alphabet or a blank. How does one write both a 'dot' and a character of the alphabet?
I guess what we can do is assign special characters for a and b when the tape head is supposed to be there. Say we assume that if the tape head is present on a, it should be represented by '?' and when on b , it should be represented by '!'. In this way when we encounter a ' ?', or a '!' on the tape, we will know that it is the position of the tape head and also we will know what is the actual symbol present there; a or b
why not just use 0 mod 3 places for first, 1 mod 3 for second and 2 mod 3 for third tape? would eliminate the reaching end of tape problem
at 11:45 you say you discussed "marking" in "just the previous lecture", but which lecture are you actually referring to? I don't recall you mentioning "marking" in Turing Machine Programming Techniques (Part 3)
Same question
Same question I had
It is indeed explained in that video towards the end, where you map every letter to a unique letter so that you can reconstruct the string after all the operations.
we need basic explanation for multitape TM, not to convert Multitape to single tape.
How can the Turing machine remember the symbols which have dots below them, before deciding which transition to take?
It has to have another tape to store this information.
not really, it may be a little misleading for him to omit that but we just define new symbols for all symbols used, so for every "symbol" (e.g. a, 1, x) we define a "symbol dot" which is only used to remember where was the head in every part of the machine and yes defining arbitrary symbols outside of present symbols to help us is fine
@@sorceryengine So is it like we are making a change from a->.a and 1->.1 and y->.y? or are we just changing the a,1,y to dots?
@@abhishekbiswas5976 both are kind of similar but I guess formally it would be the first way
Very good explanation
in which lecture marking concept is said in the programming techniques?
I know it's too late but it's in Lec. 103 (previous one)!
i am not convinced with your dot explanation
me ether
Sir where is two way infinity tape..its an important topic
A doubly infinite tape can be simulated by 2 multi-tape TMs. Which in turn can be simulated by a normal TM
great video!
So what are the questions from this topic?
Can you please provide us with these notes?
nice lectures, thanks...
How to decide the transition location i.e LLR
Isn't there a typo? Should be b1y->a1x
even i think so when you go from 1 to left you reachn to 1 so b1y--->a1x
It’s replacement, not movement. You can replace 1 with either 0 or 1
your definition of multi tape turing machine seems impractable, it would be better to show as using each transition function with the state change
thnk u sir
Can I have the transcript of this lecture?
why LLR ? IT CAN ALSO BE LLL
This is a difficult topic
The book "Introduction to the languages and the theory of computation" by john c martin has some good notes on this that might help
👏
I can't bear to watch this after 6min in. its so boringggg :(
put it in ×1.5.
I am guessing you are in computer science or related fields? Turing machine is the base of computer science and if you can't bear to watch it just drop out please. We need less idiots like you in computer science. Thanks.
@@indeeteevee bhai bacha hai kya internet pe lad rhe ho
@@indeeteevee that "thanks" at the end tho
Can i get your slides??
no
no
no
no
no
i love you
Anyone from IIT
me
Me IITB
Why are those lectures soooooo repetitive? ;o You repeat the same sentences over and over ad nauseam.
So basically we use a single-tape TM to simulate the execution of a multi-tape TM?
For the transition function, how about taking each possible combination of the three symbols and assigning them a single symbol? Then it would became a transition function for just those single symbols.
Bon Bon it is to emphasize that T M accepts languages that are RECURSIVELY ENUMERATIVE!!! 🥴
It would've been better if you used a decent microphone :\
maybe he doesn't have money to waste on a new microphone. We all can understand him clearly and that's good enough for most of us
Your typing is covering text in every vedio🥵i am not able to get it ..only speak in vedio dont write wht u are saying..
Please turn off the captions. They’re added by RUclips, and you can turn it off.
@@nesoacademy thankyou