Get the latest tech news
The Halting Problem is a terrible example of NP-Harder
It's a justifiable copout, but it's still a copout.
In computation complexity, NP is the class of all decision problems (yes/no) where a potential proof (or "witness") for "yes" can be verified in polynomial time. Most "definitely harder than NP" problems require a nontrivial background in theoretical computer science or mathematics to understand. Some point might recognize this as looking a lot like the Ackermann function, and in fact this problem is ACKERMANN-complete on the number of available dimensions.
Or read this on Hacker News