Cellular Automata

50 %
50 %
Information about Cellular Automata
Education

Published on December 12, 2008

Author: dvidby0

Source: slideshare.net

Description

On cellular automata, which are artificial systems that develop according to simple rules, but sometimes amazingly emulate nature and life.

Cellular Automata Abhranil Das 1 st year, IISER Kolkata

Definition adj. consisting of or containing a cell or cells   n.   pl.   au·tom·a·tons  or  au·tom·a·ta 1.  A self-operating machine or mechanism, especially a robot. 2.  One that behaves or responds in a mechanical way. cel·lu·lar au·tom·a·ton

adj. consisting of or containing a cell or cells

 

n.   pl.   au·tom·a·tons  or  au·tom·a·ta

1.  A self-operating machine or mechanism, especially a robot.

2.  One that behaves or responds in a mechanical way.

Definition

John Conway Born in 1973 in England, inventor of the Game of Life. Currently Professor of Mathematics, Princeton University.

Born in 1973 in England, inventor of the Game of Life.

Currently Professor of Mathematics, Princeton University.

The Game of Life Any live cell with one or zero neighbours dies from underpopulation. Any live cell with four or more neighbours dies from overcrowding. Any live cell with two or three neighbours stays alive. Any blank cell with exactly three live neighbours becomes a new live cell.

Any live cell with one or zero neighbours dies from underpopulation.

Any live cell with four or more neighbours dies from overcrowding.

Any live cell with two or three neighbours stays alive.

Any blank cell with exactly three live neighbours becomes a new live cell.

The Game of Life Any live cell with one or zero neighbours dies from underpopulation. Any live cell with four or more neighbours dies from overcrowding. Any live cell with two or three neighbours stays alive. Any blank cell with exactly three live neighbours becomes a new live cell.

Any live cell with one or zero neighbours dies from underpopulation.

Any live cell with four or more neighbours dies from overcrowding.

Any live cell with two or three neighbours stays alive.

Any blank cell with exactly three live neighbours becomes a new live cell.

Common Objects r-pentomino Glider (continuous progress) Blinker (2-phase oscillator) Block (still life)

The Termite Automaton Each termite moves in a random direction, just like Brownian motion. If it collides against a woodchip and is not carrying any woodchip at that time, it picks up that woodchip, then again goes off with it in a random direction. If it collides with a woodchip while it’s carrying one, it puts down its woodchip there, then heads off again in a random direction.

Each termite moves in a random direction, just like Brownian motion.

If it collides against a woodchip and is not carrying any woodchip at that time, it picks up that woodchip, then again goes off with it in a random direction.

If it collides with a woodchip while it’s carrying one, it puts down its woodchip there, then heads off again in a random direction.

 

Add a comment

Related presentations

Related pages

Cellular automaton - Wikipedia, the free encyclopedia

A cellular automaton is reversible if, for every current configuration of the cellular automaton, there is exactly one past configuration . [40]
Read more

Zellulärer Automat – Wikipedia

Sekundärliteratur. Francesco Berto, Jacopo Tagliabue: Cellular Automata. In: Edward N. Zalta (Hrsg.): Stanford Encyclopedia of Philosophy; Jürgen ...
Read more

Cellular Automaton -- from Wolfram MathWorld

Cellular Automaton. A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time ...
Read more

Cellular Automata (Stanford Encyclopedia of Philosophy)

Cellular automata (henceforth: CA) are discrete, abstract computational systems that have proved useful both as general models of complexity and ...
Read more

CellularAutomata - Just another WordPress site

Es sieht so aus, als ob wir nicht das finden konnten, wonach du gesucht hast. Möglicherweise hilft eine Suche.
Read more

Elementary cellular automaton - Wikipedia, the free ...

In mathematics and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states ...
Read more

Elementary Cellular Automaton -- from Wolfram MathWorld

Elementary Cellular Automaton. The simplest class of one-dimensional cellular automata. Elementary cellular automata have two possible values for each cell ...
Read more

Theory of Cellular Automata

Theory of Cellular Automata. Our discussion of finite automata outlined the workings of a class of simple machines. Though we did not study their behavior ...
Read more

The Nature of Code

The development of cellular automata systems is typically attributed to Stanisław Ulam and John von Neumann, who were both researchers at the Los Alamos ...
Read more

Cellular Automata

Reversible Cellular Automata, neighbourhoods, billiard ball machines, Java applets. By Tim Tyler.
Read more