Proof That Computers Can't Do Everything (The Halting Problem)
Thanks! Share it with your friends!
URL
Sorry, only registred users can create playlists.
583
Views
Description
If you disagree or get confused by this video, read this FAQ: http://www.zutopedia.com/halting_problem.html#faq
Click here for a list of my other works: http://www.zutopedia.com/udia.html
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:
1) This video skips a lot of technicalities for sake of simplicity. There are many rigorous descriptions of this proof easily found on the web.
2) There really is an unbeatable checkers machine. See here: http://en.wikipedia.org/wiki/Draughts#Computer_draughts
Click here for a list of my other works: http://www.zutopedia.com/udia.html
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:
1) This video skips a lot of technicalities for sake of simplicity. There are many rigorous descriptions of this proof easily found on the web.
2) There really is an unbeatable checkers machine. See here: http://en.wikipedia.org/wiki/Draughts#Computer_draughts
Post your comment
Comments
Be the first to comment
![Pythagoras Would Be Proud: High School Students' New Proof of the Pythagorean Theorem [TRIGONOMETRY]](https://i.ytimg.com/vi/p6j2nZKwf20/mqdefault.jpg)
