Volume 214, Issue 1, November 2012
Participatory Science and Computing for Our Complex World
the benefits of curating the world's best content.
|H. Eugene Stanley||1|
|protein interaction networks||1|
|random Boolean networks||1|
Your new post is loading...
We show novel techniques of analysing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order and disorder. A number of attempts have been made to classify CA functions on their spatio-temporal dynamics and to predict behavior of any given function. Examples include mechanical computation, lambda and Z-parameters, mean field theory, differential equations and number conserving features. We propose to classify CA based on their behaviour when they act in a historical mode, i.e. as CA with memory. We demonstrate that cell-state transition rules enriched with memory quickly transform a chaotic system converging to a complex global behaviour from almost any initial condition. Thus in just a few steps we can select chaotic rules without exhaustive computational experiments or recurring to additional parameters. We provide analysis of well-known chaotic functions in one-dimensional CA, and decompose dynamics of the automata using majority memory.
Delete the scoop?
Are you sure you want to delete this scoop?