Sign up to save your podcasts
Or
Share Proof That Computers Can't Do Everything (The Halting Problem)
Share to email
Share to Facebook
Share to X
Share to email
Share to Facebook
Share to X
Or
Proof That Computers Can't Do Everything (The Halting Problem)
If you disagree or get confused by this video, read this FAQ: https://www.udiprod.com/halting-problem/#faq
Visit my home page: https://www.udiprod.com
This video gives an informal presentation of Alan Turing's Halting Theorem, a serious, highly influential result in computer science.
A few more comments on this video:
This video skips a lot of technicalities for sake of simplicity. There are many rigorous descriptions of this proof easily found on the web.
There really is an unbeatable checkers machine. See here: http://en.wikipedia.org/wiki/Draughts#Computer_draughts
View all episodes
By If you disagree or get confused by this video, read this FAQ: https://www.udiprod.com/halting-problem/#faq
Visit my home page: https://www.udiprod.com
This video gives an informal presentation of Alan Turing's Halting Theorem, a serious, highly influential result in computer science.
A few more comments on this video:
This video skips a lot of technicalities for sake of simplicity. There are many rigorous descriptions of this proof easily found on the web.
There really is an unbeatable checkers machine. See here: http://en.wikipedia.org/wiki/Draughts#Computer_draughts