https://www.youtube.com/watch?v=CAA67a2-Klk
The really interesting and efficient and deeply physics-related cellular automata rules are reversible (which the Game of Life isn't).
https://en.wikipedia.org/wiki/Reversible_computing
Reversible computing is any model of computation where the computational process, to some extent, is time-reversible. In a model of computation that uses deterministic transitions from one state of the abstract machine to another, a necessary condition for reversibility is that the relation of the mapping from states to their successors must be one-to-one. Reversible computing is a form of unconventional computing.
Due to the unitarity of quantum mechanics, quantum circuits are reversible, as long as they do not "collapse" the quantum states they operate on.
A few other important but less self-aggrandizing cellular automatists:
https://en.wikipedia.org/wiki/Von_Neumann_cellular_automaton
https://en.wikipedia.org/wiki/Edward_Fredkin
https://en.wikipedia.org/wiki/Norman_Margolus
https://en.wikipedia.org/wiki/Tommaso_Toffoli
https://en.wikipedia.org/wiki/John_Horton_Conway
https://en.wikipedia.org/wiki/Richard_Feynman
https://en.wikipedia.org/wiki/Alvy_Ray_Smith
https://en.wikipedia.org/wiki/Christopher_Langton
https://en.wikipedia.org/wiki/Bill_Gosper
https://en.wikipedia.org/wiki/Rudy_Rucker
Weinstein's doesn't seem to have the same basis