Comment Re:No, it's quite correct. (Score 1) 77
No. The Halting Problem belongs to class UNDECIDABLE, not class NP-Hard. I admire your attempt at rationalizing it, but Alan Turing proved this to the world's satisfaction. If you wish to prove the Halting Problem does not belong to UNDECIDABLE then you're going to have an uphill road to hoe. If you still believe the Halting Problem belongs to NP-Hard, I would suggest you begin by correcting its Wikipedia article.)
Your argument involving an oracle that solves the Halting Problem is absurd because you're assuming the existence of hypercomputation -- and if such an oracle could exist, then we would simultaneously have P=NP and P != NP. Martin Davis has gone so far as to declare hypercomputation both "a myth" and "a nonexistent discipline." Those are strong words coming from one of the brightest lights in the field of computational theory and computational complexity.
It's a bedrock principle of logic that if you start from a false proposition anything can be proven. You assume the existence of an oracle that can solve the Halting Problem. This is a false proposition. Anything can be proven once you make oracular assumptions.