A Cellular Automaton is inherently parallelizable because the state of any given cell at time t+1 can be computed from nothing more than the the state of its ne

A Cellular Automaton is inherently parallelizable because the state of any given cell at time t+1 can be computed from nothing more than the the state of its neighbors at time t, see http://www.cs.ox.ac.uk/geraint.jones/publications/book/Pio2/life.ps http://www.cs.ox.ac.uk/geraint.jones/publications/book/Pio2/...