I know it is Turing-complete; I was instead commenting on its computational irreducibility. My point is that it is impossible to express the rules in the form of an associative operator over a sequence of board states. You could say the same thing about iterating with a sufficiently complex circuit of NOR gates.