Cellular Automata

What is a Cellular automaton?

A Cellular automaton is a special kind of universe: space is divided into a finite number of cells, while time advances in time ‘hops'(t=0,1,2,3,…)
Each cell has a state ( for ex.: ‘Dead’, ‘Alive’, ‘True’, ‘False’, ‘Red’, ‘Blue’). A cell represents a Finite State Machine.
The cells are connected together. A group of connected cells is called a neighborhood/cluster. The state of the cell is affected by the states of it’s neighbors.
In the common scenario when time changes(for ex. t=1) each cell changes it’s current state in parallel to the other cells in the automaton.
A cellular automaton could exist in multiple dimensions: 1-D, 2-D, 3-D, …
One could think of a cellular automaton as a multi-agent system. Each cell represents an agent. Global emerging behavior could be observed in result of local interactions between cells.

More about Cellular automata:
http://en.wikipedia.org/wiki/Cellular_automaton
http://mathworld.wolfram.com/CellularAutomaton.html

Cellular Automata

Intro: Life-like Cellular automata

Life-like cellular automata are composed of “living” cells. A living cell has two possible states: Dead or Alive.
By default a cell dies except in these cases:

  • A cell survives if surrounded by N living neighbors
  • A cell comes to life if surrounded by K living neighbors

where N and K are integers (for ex. N=2, K=3)

Interesting facts:

Life-like automata are able to produce self-replicating patterns.
Life-like cellular automata display emerging behavior – global behavior resulting from local interactions

more info:

RABBIT by MORPHOCODE

3 thoughts on “Intro to Cellular automata

Leave a Reply

Your email address will not be published. Required fields are marked *