factual
Halting problem is unsolvable not merely hard
The halting problem and the traveling salesman problem are not really related: the traveling salesman problem is hard (takes many steps) but solvable, whereas the halting problem is literally unsolvable — there is no way to determine just by inspecting a program whether it will halt, since running it can only ever confirm halting within a finite time, never prove it never halts.
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”
Created: 6/13/2026, 12:14:43 AM
Your notes
Loading notes...