(cellular automata) Having the state of each cell represented by a number, and the value of a cell dependent only on its current value along with the sum of the values of nearby cells.
2003 January 18, Frank Buss, “Searching detailed description of Codd's automaton”, in comp.theory.cell-automata[1] (Usenet):
Why it is important, to design totalistic or outer totalistic rules?
2003 December 13, Ilmari Karonen, “'TimeWarp' CA rule -- anyone recognize this one?”, in comp.theory.cell-automata[2] (Usenet):
It's the second-order reversible outer totalistic rule b1234/s0123R on the von Neumann neighborhood.
2007 August 28, Bob, “Lambda value of (outer-)totalistic code”, in comp.theory.cell-automata[3] (Usenet):
Hello, How to compute lambda value for (outer-)totalistic rule? Is it the same way like computing for elementary?