The Halting Problememememem…

Sebastion Oberhoff
University of Wisconsin-Milwaukee
PhD Graduate Student

“Imagine we have a procedure called P
that for specified input permits you to see
whether specified source code, with all of its faults,
defines a routine that eventually halts.

Well, the truth is that P cannot possibly be,
because if you wrote it and gave it to me,
I could use it to set up a logical bind
that would shatter your reason and scramble your mind.”

– Adapted from Scooping the Loop Snooper by Geoffrey K. Pullum

In this talk we’ll prove the undecidability of the Halting Problem and explore a few of its consequences.