Prove that the language Loop Turning Machine =  {  < M > | M is a TM that loops on all inputs}  is recognizable.  I feel like $M$ would never halt.  To make $M$ recognizable it needs to accept or reject.  Do I need to establish a decider?  EDIT:Can I say that a halting Turing Machine $M$ is a machine for which  exists a word $w$ such that $M$ halts on $w$? This makes the language recognizable but the machine may go on forever if executed.  
Language of Turing machines that loop on all inputs, recognizable?
turing machines;decision problem