Comment by Obi_Juan_Kenobi
8 years ago
You could try expanding this project beyond elementary CAs.
One option is a 'totalistic' CA which looks at the average value of a given neighborhood, and can have more than two states.
http://mathworld.wolfram.com/TotalisticCellularAutomaton.htm...
Or you could generate CAs with different starting conditions. Some beautiful elementary CAs don't 'show up' with just one initial point.
The Moveable Feast Machine is similar to cellular automata, but different in some important ways, that make it extremely robust and fault tolerant:
It's a "Robust First" asynchronous distributed fault tolerant cellular-automata-like computer architecture.
Robust programs running on massively parallel unreliable hardware can actually tolerate hardware failure and repair themselves. The Demon Hoard Sort algorithm is an inherently robust sorting algorithm for the Moveable Feast Machine.
https://news.ycombinator.com/item?id=14236973