Episode #488 from 1:31:30

The Halting Problem

Can you describe the halting problem? Because it's a thing that shows up in a very useful and, again, traumatic way through a lot of computer science, through a lot of mathematics. Yeah. The halting problem is expressing a fundamental property of computational processes. So given a program, or maybe we think of it as a program together with its input, but let me just call it a program. So given a program, we could run that program, but I want to pose it as a decision problem. Will this program ever complete its task? Will it ever halt? And the halting problem is the question, given a program, will it halt? Yes or no? And of course, for any one instance, the answer's either yes or no. That's not what we're talking about. We're talking about whether there's a computable procedure to answer all instances of this question.

Why this moment matters

Can you describe the halting problem? Because it's a thing that shows up in a very useful and, again, traumatic way through a lot of computer science, through a lot of mathematics. Yeah. The halting problem is expressing a fundamental property of computational processes. So given a program, or maybe we think of it as a program together with its input, but let me just call it a program. So given a program, we could run that program, but I want to pose it as a decision problem. Will this program ever complete its task? Will it ever halt? And the halting problem is the question, given a program, will it halt? Yes or no? And of course, for any one instance, the answer's either yes or no. That's not what we're talking about. We're talking about whether there's a computable procedure to answer all instances of this question.

Starts at 1:31:30
People and topics
All moments
The Halting Problem chapter timestamp | Infinity, Paradoxes that Broke Mathematics, Gödel Incompleteness & the Multiverse - Joel David Hamkins | EpisodeIndex