Universal Turing Machine || Lesson 91 || Finite Automata || Learning Monkey ||

[@tdm2146]

after three videos finally understood.
The best teacher...👍

[@srisaiharshitha]

it's crt

[@jaspreetsinghkalsi2572]

One of the best educators I have ever seen for ToC.

[@LearningMonkey]

Thank you
Have a great learning in CSE

[@Future_software_enginneer]

Truly it is very easy to understand thankyou ❤😊

[@LearningMonkey]

Thank you
Have a great learning in CSE

[@EagleTube-ph6wh]

Excellent tutorial(from ethiopia)

[@convowithashmit]

Video start 2:05

[@vikrant5211]

You are The best ❤

[@tonypepper]

Sir , in tape 1 any turning machine cane be put at same time ? Like TM for addition and subtraction and comparison all together?

[@LearningMonkey]

Yes
We use the TM required for our situation.
Same as storing programs in a tape.
Selecting them when ever required

[@suindude8149]

If a Turing machine reads twice a in this we have another transition maintained as rule if present in the rule set.

[@chavaligangadevi8663]

Good explanation

[@LearningMonkey]

Thanks and welcome

[@gopireddysindhureddy1192]

Best teaching monkey

[@LearningMonkey]

Haha thank you
Have a great learning in CSE

[@payal6967]

Chommu

[@m.yaswanthyaswanth5872]

§(q0,a)=§(q1,X,R)
Then what's the value of X

[@LearningMonkey]

X is a symbol to replace with a

[@vikasbharti5455]

Samjh ni aaya last me à à à bolata hai ye kyaa a .a .a bolta hai😅😅 can't understand what you teach us