Cellular Automate

The One Dimensional Cellular Automate

Once again, your web browser doesn't support Java, which is needed to view this simulation.

"Click pause to start"

Controls:

The button at the very bottom right is the pause/go button.
You can change the rules by clicking on the rightside grids.
(the top line is the condition of the bit and it's two neightbours, the bit under is it's new state)
The "R" button at the bottom right of the grid will place a random pattern on the top line.
The "C" button will clear it.

Cellular automata are computer simulations that try to emulate the way the laws of nature are supposed to work in nature. Possibly, they could tell us whether the reductionistic approach research always has adopted is realistic. Is it really possible to imagine our fascinating, complex and sometimes seemingly random world as created by a small set of relatively simple rules? Cellular automata can never give definitive answers to these questions, since they don't claim to emulate nature in more than a rough way. But they could give us an idea of how reasonable the thought of a world governed by simple rules is.

In this one-dimensional example, only the actual bit-state and it's two neightbours's states affect the next bit-state in t+1. The new resulting vector is the sequence of every individual condition check of the initial vector (shown rightside) that will give the new state vector, wich will be presented in the next line. This vector is then the new state vector and the process repeatrs.