"Cellular [automata] is an entirely local computation, fully compatible with promise theory..." #readingToday

Cellular computation is an entirely local computation, fully compatible with promise theory, and made famous by British mathematician John Horton Conway's Game of Life, in 1970 273 . It can simulate complex emergent pattern generation, and display a rich set of behaviours including fixed points and limit cycles. Automata are used as models for cellular life, robotics and even studying material properties...

In Search of Certainty, Mark Burgess, 2013