8/3/2019 Cellular Automata and Nature

http://slidepdf.com/reader/full/cellular-automata-and-nature 1/2

8/3/2019 Cellular Automata and Nature

http://slidepdf.com/reader/full/cellular-automata-and-nature 2/2

Alive cells can survive when they have either 2 or 3 neighbors. Two

central dots have exactly 2 living neighbors, so they will survive. Two

other dots have only 1 neighbor; they will die of loneliness.

Four of them have exactly 3 neighbors; those four cells will become

alive. The rest of empty cells will stay off - they have only 0, 1 or 2

neighbors.

Next Generation:

4 cells will survive (the ones with 3 neighbors). Two other cells have to

die

2 empty cells have 3 neighbors and will come alive. The rest will stay off.

Third Generation:

No cells have 3 neighbors, so no new cells will come alive. All alive cells

have exactly 2 neighbors, so all of them will survive. We have reached astable pattern (still life) that will not change in next generations.

Some of best known applications of Cellular Automata are:

y  image processing and image generation,

y  simulations of biology,

y  simulations of chemistry,

y  simulations of physics,

y  design of new computing hardware and algorithms,

y  art

Nature Inspired Computing (NIC) is one that aims to develop new computing techniques after

getting ideas by observing how nature behaves in various situations to solve complex problems.

Nature presents the best example of how to solve problems efficiently and effectively. We attempt

to create computational methods for addressing problems by transferring knowledge from natural

systems to engineered systems.

Examples of engineering uses include:

y  image processing and mining

y  information retrieval and knowledge extraction

y  modelling and analysis of genetic and metabolic networks for drug design and disease

analysis

y  aerodynamic structure design

y  Self-organization of collective systems.

Source: http://psoup.math.wisc.edu/mcell/whatis_life.html,Wikipedia and other sources,

http://www2.surrey.ac.uk/computing/research/bima/index.htm