A language is NP-hard if all languages in NP can be reduced to it

• Translation: Problems that are at least as hard as all NP problems
• It doesn't have a limit on HOW MUCH harder. So even halting problem (and all undecidable problems) is NP-hard

How to prove

You can't