Again ... thanks a lot. this is the best UTM lecture/read I have ever come across and this is narrated so close to a computer machine (47:40) language that now everything falls in place. Thanks a lot and you saved me.
Just to be picky: At 43:50, we cannot go back and scan for the transition to rule to determine R,L move without actually saving "old" Q and w somewhere, as we have already written new q and w into the temporary tapes.
Thanks for good explaination . But, how come does the input of "D" can be just description of Turing machine ?? Can I just think about the Turing machine which works for the particular input w?
Good lecture, I strongly disagree about Powerpoint (or TeX, really). I don't like having to listen to someone talk ex-tra-slow-ly because they are trying to write at the same time. Most of the time, they try to ameliorate this by writing very fast, which just results in more illegible words.
Good lecture, I strongly disagree about Powerpoint (or TeX, really). I don't like having to listen to someone talk ex-tra-slow-ly because they are trying to write at the same time. Most of the time, they try to ameliorate this by writing very fast, which just results in more illegible words.
@@rj-nj3uk yes, ideally you should put steps on different slides (or animate slides, which is essentially the same). I'm not pro-Powerpoint, classic physical slides are often perfectly adequate
Again ... thanks a lot. this is the best UTM lecture/read I have ever come across and this is narrated so close to a computer machine (47:40) language that now everything falls in place. Thanks a lot and you saved me.
Wish this course was taught this way in my school.
Nicely explained. It makes sense so much now. Thanks for this amazing lecture.
Just to be picky: At 43:50, we cannot go back and scan for the transition to rule to determine R,L move without actually saving "old" Q and w somewhere, as we have already written new q and w into the temporary tapes.
This is the best video/explanation I have seen on this subject. Thank you Professor!!!!
Thanks for good explaination .
But, how come does the input of "D" can be just description of Turing machine ??
Can I just think about the Turing machine which works for the particular input w?
nice proof about the UNDECIDABILITY of the halting problem.
Good old days before Profs became over-dependent on Powerpoint slides :) ... Great delivery, Prof.
Good lecture,
I strongly disagree about Powerpoint (or TeX, really).
I don't like having to listen to someone talk ex-tra-slow-ly because they are trying to write at the same time. Most of the time, they try to ameliorate this by writing very fast, which just results in more illegible words.
Good lecture,
I strongly disagree about Powerpoint (or TeX, really).
I don't like having to listen to someone talk ex-tra-slow-ly because they are trying to write at the same time. Most of the time, they try to ameliorate this by writing very fast, which just results in more illegible words.
@@rj-nj3uk yes, ideally you should put steps on different slides (or animate slides, which is essentially the same). I'm not pro-Powerpoint, classic physical slides are often perfectly adequate
Perfect explanation and teaching
Excellent didactics, it help a lot.
great lecture, thanks !
Very very good about UTM.
beautiful proof. i finally get it
Nice proof. Thanks.
Sound's real random.. Clean is unknown , proof is random, zero is fantom output...?
Nicely articulated.