As for how they are different from general dynamical systems, the GDSs I've seen have a small set of differential equations that describe the whole system; a cellular automaton has the same rule for each cell but the system comprises a large number of cells. In other words, locality and massive parallelism.
But this isn't my field so correct me if I'm wrong...
And even classical game of live is turing complete. They built a TM inside GoL!
But it can be modeled by a finite state automaton (if the grid is finite), I suppose, so the rules are just a regular grammar.
A regular machine can output the grammar of a context sensitive language, but not accept the corresponding programms. In the same sense, the turing machine in GoL is ...
you know what, I have no idea.
In other words, each cell would encode its distance to all other cells. Which seems a bit redundant.