Cellular Automata

Cellular automata are discrete time dynamical systems defined on a discrete space, or lattice as coupled maps. The crucial difference is that the state space associated to each lattice site must also be discrete (countable), whereas for coupled maps the state space is at least uncountable, and usually continuous. The most famous example of a cellular automaton is Conway's Game of Life, based on a two-dimensional lattice. Each lattice site has a state which is either on (alive) or off (dead) and the system passes from one generation to the next by way of a set of rules dependent on the eight neighbouring sites for each cell.

Articles on KurzweilAI.net that refer to Cellular Automata

Reflections on Stephen Wolfram's 'A New Kind of Science' By Ray Kurzweil
Wolfram and Kurzweil Roundtable Discussion By Ray Kurzweil and Stephen Wolfram
Richard Feynman and The Connection Machine By W. Daniel Hillis
Intelligence as an Emergent Behavior or, The Songs of Eden By W. Daniel Hillis
Book Review: A New Kind of Science By Scott Aaronson
The Intelligent Universe By Ray Kurzweil
The Age of Intelligent Machines: Footnotes By Ray Kurzweil
The Age Intelligent Machines, Chapter Six: Electronic Roots By Ray Kurzweil
A Computational Foundation for the Study of Cognition By David Chalmers
Chapter 9: Bit Beliefs By Neil Gershenfeld

News Articles that refer to Cellular Automata

Ray Kurzweil reviews Stephen Wolfram's long awaited new book 'A New Kind of Science'
Kurzweil reviews Wolfram's book, 'A New Kind of Science'
Composer harnesses artificial intelligence to create music
Do plants act like computers?
Study: Self-replicating nanomachines feasible
SIA sets national research initiative

Related Links

Cellular Automata
Cellular Automata Tutorial