Cellular Automata with Memory

Memory is a universal of organized matter. What is the mathematics of memory? How does the memory affect space-time behaviour of spatially extended systems? Does the memory increase complexity? Cellular automaton models give us the answers. A cellular automaton is an array of locally connected finite state machines, or cells. The cells update their states simultaneously, in discrete time, by the same cellstate transition rule. Classical cellular automata are memoryless : a cell updates its state depending on current states of its neighbours. The book revolutionizes the conventional view on cellular automaton evolution by allowing cells to update their states looking at past states of their neighbours and analyses the effect of memory on a wide range of spatialized discrete dynamical systems scenarios. The book demonstrates that cellular automata with memory are not only priceless tools for modelling of natural phenomena but unique mathematical and aesthetic objects...