Turing recognizable - $B = \{a^n b^n c^n \}$

Question

Question:

My answer is no, because it loops forever. But I am a bit unsure if this is the right answer.

Answer 1

Construct a Turing machine that checks it is $a$s followed by $b$s and by $c$s, if not, reject. Go back to the beginning, cross out an $a$, a $b$ and a $c$, and start over at the beginning. If no uncrossed symbols remain, accept.

As it is accepted by the Turing machine outlined, the language is Turing recognizable.