Abstract
In this paper a detailed proofwill be given of the solvability of the halting and reachability problem for binary 2-tag systems.