idkwhoiam129
Steampunker
Hello hello! Since the release of the 1.3.1 update, I've been very busy with the new logic gates and wires. I decided to get straight to it and build a display for elementary cellular automaton. Now if you don't know what this is, I'll give a description from the wolfram website: http://mathworld.wolfram.com/ElementaryCellularAutomaton.html
Elementary cellular automata have two possible values for each cell (0 or 1), and rules that depend only on nearest neighbor values. As a result, the evolution of an elementary cellular automaton can completely be described by a table specifying the state a given cell will have in the next generation based on the value of the cell to its left, the value the cell itself, and the value of the cell to its right. Since there are 2x2x2 = 2^3 = 8 possible binary states for the three cells neighboring a given cell, there are a total of 2^8 = 256 elementary cellular automata, each of which can be indexed with an 8-bit binary number (Wolfram 1983, 2002). The possible values of the three neighboring cells are shown in the top row of each panel, and the resulting value the central cell takes in the next generation is shown below in the center. The evolution of a one-dimensional cellular automaton can be illustrated by starting with the initial state (generation zero) in the first row, the first generation on the second row, and so on.
So, on with the video!
Here's a video to explain each cell:
Here is the download link to the world:
http://www.mediafire.com/download/7rpho94cy9b6f94/Elementary+Cellular+Automaton.wld
And here are some screenshots of the build:
Screenshot from TEdit:
Some of the wiring:
Screenshot of the map:
Elementary cellular automata have two possible values for each cell (0 or 1), and rules that depend only on nearest neighbor values. As a result, the evolution of an elementary cellular automaton can completely be described by a table specifying the state a given cell will have in the next generation based on the value of the cell to its left, the value the cell itself, and the value of the cell to its right. Since there are 2x2x2 = 2^3 = 8 possible binary states for the three cells neighboring a given cell, there are a total of 2^8 = 256 elementary cellular automata, each of which can be indexed with an 8-bit binary number (Wolfram 1983, 2002). The possible values of the three neighboring cells are shown in the top row of each panel, and the resulting value the central cell takes in the next generation is shown below in the center. The evolution of a one-dimensional cellular automaton can be illustrated by starting with the initial state (generation zero) in the first row, the first generation on the second row, and so on.
So, on with the video!
Here's a video to explain each cell:
Here is the download link to the world:
http://www.mediafire.com/download/7rpho94cy9b6f94/Elementary+Cellular+Automaton.wld
And here are some screenshots of the build:
Screenshot from TEdit:

Some of the wiring:

Screenshot of the map:

Last edited: