No Two-State CA for Density Classification Exists

Recently there have been many attempts to evolve one-dimensional two-state cellular automata which classify binary strings according to their densities of 1's and 0's. The current best-known approaches involve particle-based systems of information transfer. A proof is given that there does not exist a two-state CA which performs the task perfectly .