Impossible Programs (The Halting Problem)

Cory Chang explains the halting problem and undecidability using Cantor's diagonalization argument.

Some programming problems are so hard that they’re impossible. We look at the first problem to have been proved undecidable, the halting problem, which was instrumental in forming the basis of the modern computer. Created by: Cory Chang Produced by: Vivian Liu Script Editors: Justin Chen, Brandon Chen, Elaine Chang, Zachary Greenberg The Halting Problem: en.wikipedia.org/wiki/Halting_problem Entscheidungsproblem: en.wikipedia.org/wiki/Entscheidungsproblem Turing Machine: en.wikipedia.org/wiki/Turing_machine Church-Turing Thesis: en.wikipedia.org/wiki/Church–Turing_thesis Turing’s Paper, About: philocomp.net/home/turing.htm Turing’s Paper, Original: cs.virginia.edu/~robins/Turing_Paper_1936.pdf --- Twitter: twitter.com/UBehavior