Alternation #4 - ALogSpace = P
We show that ALogSpace = P. Therefore, the problems that can be solved with an alternating log-space-constrained Turing machine are precisely the problems that can be solved with a deterministic Turing machine in polynomial time. The alternating reachability problem also plays a role here.