Halting Problem
The cluster centers on discussions of the halting problem in computer science, including its undecidability, relations to specific programs or proofs, and claims about solving it.
Activity Over Time
Top Contributors
Keywords
Sample Comments
Something like this? https://en.m.wikipedia.org/wiki/Halting_problem
The resolution of the Halting Problem shows you can't even determine whether the complexity is finite!
Isn't this just an example of the halting problem? As in, you can't prove that a program won't ever halt.
What progress are computers making on being able to tell if an arbitrary program halts?
If you can't prove the halting problem, how can you disprove forever? :)
are you aware of the halting problem?
You jest, but the halting problem is only unsolvable in the general case. For "most" (but not all) programs it is perfectly possible to prove whether or not they will halt.
It's a joke :)https://en.wikipedia.org/wiki/Halting_problem
Perhaps a better explanation - it's similar to the halting problem in computer science. There are programs p where "Program p halts on input x" is unprovable (equivalently there is no computable way to determine which p,x halt), and the key is that we have no way of knowing which programs p and x this is true for, of the ones we don't yet have proofs/halt-prediction-programs about.You may want to argue that this can be "solved" by never letting programs take
Did someone solve the halting problem while I wasn't looking?