Universal Turing Machine

[@petersharwarko682]

My computation theory class is giving the the topics, but you are the one teaching me computation theory. Thank you so much!

[@stefantincescu7169]

Just in time for my exam! Thank you sir. Best videos on youtube.

[@hmsingh2321]

Stetin fancescu

[@tanushree0106]

00:01 Universal Turing Machine: Overview
01:06 The language ATM is Turing recognizable.
02:11 Universal Turing Machine can determine if a given Turing machine accepts a certain string
03:12 Universal Turing Machine behaves like the Turing machine passed to it.
04:17 Universal Turing Machine can hold, accept, reject or not hold.
05:17 A universal Turing machine can behave in different ways: accepting, rejecting, or looping.
06:16 Universal Turing Machine is like a computer that behaves based on the program you input.
07:16 Universal Turing Machine is a recognizer but not a decider for the language ATM

[@sambhusdharan7532]

Your classes are amazing ...hats off ❤️ sir

[@andydev6168]

Awesome man, you made a no-where concept an amazing class!
You nailed it!

[@md.redwankarimsonylecturercse]

Thank you so much for your lucid explanation. Many of the professors fails to make these things clear in graduate level courses.
Hats off!

[@haricharanpal1761]

Such a soothing voice that helps me concentrate more.

[@saniasinghania1183]

i completely agree with you.

[@jindagi_ka_safar]

So each program we write ( in C/Java/Python) is actually a TM and our computer (compiler) is the UTM, right?

[@anuraggadaria9408]

the analogy seems to be correct

[@kushagraacharya1700]

Very very broadly

[@balurockz_17]

Wrong ❌

[@shobhit00gupta]

Neso academy is the best

[@sambhusdharan7532]

It's true my friend..

[@pramodthapa4645]

Thank you a lot for such a nice video series in TOC.

[@JD-SANJEY]

Thank you sir ,, clear crystal explanation,,, sir please explain the concept of Reducibility

[@narendraparmar1631]

Thanks Neso Academy for this precious knowledge

[@benjaminbelay8991]

Phenomenal video, honestly thank you

[@lakshaysharma6390]

Thank you sir 🙏

[@trywellwashington7506]

Turing recognizable: enumerable...?
A_TM: set of strings that would be accepted by a particular Turing Machine?

[@bonbonpony]

Where's the actual representation though? (the "programming language" of the TM)
It is not sufficient to just say that something _can_ be done and leave all the details hanging.

[@sxysir]

yea

[@vertigo333]

very very very thank you sir

[@pratishthachaurasia6326]

Can you add Reducibility to it?

[@MafiaRazeX]

Pratishtha Chaurasia reducability is converting the problem into another problem so that it can be a solution to the first problem.
for e.g.
if
w€A then soln of A or F(w)€ B

[@vaidhyanathansm7625]

Nice Video...!

[@mindbodyps]

Thanks

[@kaivalyaborgaonkar1517]

M is a TM and M RECEIVES w. 'Accepts' confused me a bit.

[@sharmatvpresents616]

Outstanding

[@dassaurabh638]

thanx

[@maheshkale5655]

made for X2 speed :P

[@dhanushsivajaya1356]

Thankyou sir

[@QuantumWithAnna]

The India-style sing-song where the speaker stops halfway through the sentence on a rising note, pauses for a split-second and then continues has been very common and is, for me, quite distracting and annoying

[@romanverostko4658]

Than you

[@shubhamwasade3736]

wow what a video..!!!!

[@shubhamwasade3736]

thnXxx man!

[@shubhamwasade3736]

Ur welcome bro:)

[@mrityunjaybarua7973]

@@shubhamwasade3736 want some machines How to cominication

[@ramnarayanvishwakarma5783]

UNIVERSAL DRILLING MACHINE

[@arkaprovasaha4313]

Why is my musicxmatch showing lyrics of Baby Universal by Tin Machine when I play the video 😶🤔

[@saniyamalik6718]

??? this is not even an explanation...

[@iskhwa]

this video was actually useless. Nothing about how it is actually done, just reading some line

[@Deathtonewworldorder]

Any recent problem video? Not shown in search result

[@arnobchowdhury1804]

Channel named hhp3 is copying you content without your permission.

[@raghus8535]

How do you represent M sir

[@lucutes2936]

ZOV