Hacker News new | ask | show | jobs
by acuozzo 1293 days ago
How will the AI overcome the halting problem?
4 comments

You can't in general determine if an arbitrary program will halt. I believe it is however, possible to construct a program that does provably halt. I have no idea if you can write most useful programs that way though.
Almost all programs that people write are written so that they provably halt (or provably don't halt - as continuing forever is sometimes the desired behavior).

How do we do that? By using known-halting parts, and composing them in known-halting ways. How did we find those parts in the first place, well computer science.. But boiling that down to a codified process, that's where it gets murkier. I think we don't really know exactly how human ingenuity discovers new useful halting parts in the face of the halting problem.

Easy - it will come up with a solution too complicated for mere humans to understand, at which point everyone will assume it is correct.
The same way that humans do. By redefining "doesn't halt" as "didn't halt before my patience ran out".
Well humans haven't overcome it, and we muddle through. Same with AI, it seems.