Artyom Bologov@neauoire are you by any chance aware of some work doing “useful” computation with cellular automatons?
hairylarryNow I want to look that up.
wikipedia
In the 1980s, Stephen Wolfram engaged in a systematic study of one-dimensional cellular automata, or what he calls elementary cellular automata; his research assistant Matthew Cook showed that one of these rules is Turing-complete.
I find that interesting. They also cover toroidal cellular automata which are actually easier to define the rectangular cellular automata.
part1
part 2
von Neumann came to realize the great difficulty of building a self-replicating robot
Again interesting.
Ulam and von Neumann created a method for calculating liquid motion in the late 1950s.
Are there 3 dimensional cellular automata? n dimensional?
Also in 1969 computer scientist Alvy Ray Smith completed a Stanford PhD dissertation on Cellular Automata Theory, the first mathematical treatment of CA as a general class of computers.
part 3
The Game of Life can emulate a universal Turing machine.
Biology
Several biological processes or phenomena can be simulated using cellular automata.
Chemistry
The Belousov–Zhabotinsky reaction is a spatio-temporal chemical oscillator that can be simulated by means of a cellular automaton.
Physics
Probabilistic cellular automata are used in statistical and condensed matter physics to study phenomena like fluid dynamics and phase transitions.
Fascinating