Oh ok, I understand what you mean.

(By the way, I think you mean NP-complete, not NP-hard. The Halting Problem is NP-hard.)

The halting problem is NP hard, technically speaking, but it's much harder than that - it's uncomputable. I don't think it's common to refer to it as NP-hard because it's confusing.

Thanks for the correction! I updated my answer to fix that :)