The Halting Problem
In this video, we study a classic problem introduced by Alan Turing, the so-called halting problem. In the halting problem, our input is the source code of any computer program, and we want to know whether this computer program eventually terminates. We show that in general the halting problem is not solvable, not even if we have unlimited time and resources. The halting problem is an example of Kurt Gödel’s incompleteness theorem, which says that any complicated enough system must exhibit unsolvable problems.
Watch video The Halting Problem online without registration, duration hours minute second in high quality. This video was added by user Computational Thinking 14 December 2022, don't forget to share it with your friends and acquaintances, it has been viewed on our site 927 once and liked it 20 people.