you are viewing a single comment's thread.

view the rest of the comments →

[–]pg1989 1 point2 points


The halting problem isn't NP-hard, or soft, or anything in between. It doesn't even have a complexity class, because it provably isn't computable by any machine in any model of computation that we know of. That said, I'm not sure whether human cognition can solve the halting problem. My gut says no, but to show conclusively one way or the other you'd have to have a complete understanding of how the human brain actually works, which we are far from having.