Showing that the set of DTMs that run forever is not Turing-recognizable
This is not the halting problem, the halting problem is the set of TMs that do halt, the language $A$ is the set of TMs that don't halt. It's the complement of the halting problem.

You also seem to be mistaken in that the halting problem is recognizable, it's just not decidable.