Proof That Computers Cannot Solve All Problems: The Halting Problem
An explanation of why computers are limited in their capabilities, focusing on the Halting Problem and its implications for computation.
udiprod
2.7M views • Sep 27, 2013
About this video
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:
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
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:
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
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
2.7M
Likes
82.4K
Duration
7:52
Published
Sep 27, 2013
User Reviews
4.8
(538) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
No specific trending topics match this video yet.
Explore All Trends