The language A, that is all DTMS that run forever on input.
Would this not just be the HALT problem?
Therefore no reduction or proof is necessary, other then stating that?
ANSWER FOUND: I think i have it, if it was Turing Recognizable, then it would be possible to determine when HALT should reject and therefore HALT would be decidable. Since it is not-decidable, then A must be not Turing Recognizable.