Important examples of unsolvable problems include: -is a statement of predicate logic valid? -is a statement in the language of rings true in the theory of rings? -is a polynomial with integer coefficients have an integer root? The list goes on.
NP hard means every problem is NP is no harder. NP complete means in addition the problem is in NP.