factual
Halting Problem Is Unsolvable Not Just Hard
The halting problem and the traveling salesman problem are not really related: the traveling salesman problem is merely hard (takes many steps), whereas the halting problem is literally unsolvable — there is no way to know just by inspecting a program whether it will halt, other than running it, which can only ever confirm halting within a finite time, never confirm non-halting.
factualpending
Speaker
Sean CarrollEvidence Quote
“There's literally no way of knowing just by looking at a computer program whether it is guaranteed to halt or not, other than running it and seeing if it halts, but there you can only show that it does halt in a certain period of time, you can't show that it doesn't”
Created: 6/13/2026, 3:35:09 AM
Your notes
Loading notes...