Cellular Automata with Memory

Abstract

Standard Cellular Automata (CA) are ahistoric (memoryless): i.e., the new state of a cell depends on its neighbourhood configuration only at the preceding time step. Historic memory of all past iterations can be incorporated into CA by featuring each cell by a summary of all its past states. CA with memory turn out to be a natural and interesting generalization of the CA paradigm.