A Cellular Automaton is inherently parallelizable because the state of any given...

		haliax on Oct 30, 2011 \| parent \| context \| favorite \| on: Brain-like, massively parallel computer made from ... 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/...

thanks