Question: is halting problem np complete?
Answer: It is easy to prove that the halting problem is NP-hard but not NP-complete. ... There are also NP-hard problems that are neither NP-complete nor Undecidable. For instance, the language of true quantified Boolean formulas is decidable in polynomial space, but not in non-deterministic polynomial time (unless NP = PSPACE).