• Source: Von Neumann cellular automaton

Von Neumann cellular automata are the original expression of cellular automata, the development of which was prompted by suggestions made to John von Neumann by his close friend and fellow mathematician Stanislaw Ulam. Their original purpose was to provide insight into the logical requirements for machine self-replication, and they were used in von Neumann's universal constructor.
Nobili's cellular automaton is a variation of von Neumann's cellular automaton, augmented with the ability for confluent cells to cross signals and store information. The former requires an extra three states, hence Nobili's cellular automaton has 32 states, rather than 29. Hutton's cellular automaton is yet another variation, which allows a loop of data, analogous to Langton's loops, to replicate.




Definition






= Configuration

=
In general, cellular automata (CA) constitute an arrangement of finite state automata (FSA) that sit in positional relationships between one another, each FSA exchanging information with those other FSAs to which it is positionally adjacent. In von Neumann's cellular automaton, the finite state machines (or cells) are arranged in a two-dimensional Cartesian grid, and interface with the surrounding four cells. As von Neumann's cellular automaton was the first example to use this arrangement, it is known as the von Neumann neighbourhood.
The set of FSAs define a cell space of infinite size. All FSAs are identical in terms of state-transition function, or rule-set.
The neighborhood (a grouping function) is part of the state-transition function, and defines for any cell the set of other cells upon which the state of that cell depends.
All cells make their transitions synchronously, in step with a universal "clock" as in a synchronous digital circuit.




= States

=
Each FSA of the von Neumann cell space can accept any of the 29 states of the rule-set. The rule-set is grouped into five orthogonal subsets. Each state includes the colour of the cell in the cellular automata program Golly in (red, green, blue). They are

a ground state U (48, 48, 48)
the transition or sensitised states (in 8 substates)
S (newly sensitised) (255, 0, 0)
S0 – (sensitised, having received no input for one cycle) (255, 125, 0)
S00 – (sensitised, having received no input for two cycles) (255, 175, 50)
S000 – (sensitised, having received no input for three cycles) (251, 255, 0)
S01 – (sensitised, having received no input for one cycle and then an input for one cycle) (255, 200, 75)
S1 – (sensitised, having received an input for one cycle) (255, 150, 25)
S10 – (sensitised, having received an input for one cycle and then no input for one cycle) (255, 255, 100)
S11 – (sensitised, having received input for two cycles) (255, 250, 125)
the confluent states (in 4 states of excitation)
C00 – quiescent (and will also be quiescent next cycle) (0, 255, 128)
C01 – next-excited (now quiescent, but will be excited next cycle) (33, 215, 215)
C10 – excited (but will be quiescent next cycle) (255, 255, 128)
C11 – excited next-excited (currently excited and will be excited next cycle) (255, 128, 64)
the ordinary transmission states (in 4 directions, excited or quiescent, making 8 states)
North-directed (excited and quiescent) (36, 200, 36) (106, 106, 255)
South-directed (excited and quiescent) (106, 255, 106) (139, 139, 255)
West-directed (excited and quiescent) (73, 255, 73) (122, 122, 255)
East-directed (excited and quiescent) (27, 176, 27) (89, 89, 255)
the special transmission states (in 4 directions, excited or quiescent, making 8 states)
North-directed (excited and quiescent) (191, 73, 255) (255, 56, 56)
South-directed (excited and quiescent) (203, 106, 255) (255, 89, 89)
West-directed (excited and quiescent) (197, 89, 255) (255, 73, 73)
East-directed (excited and quiescent) (185, 56, 255) (235, 36, 36)
"Excited" states carry data, at the rate of one bit per state transition step.
Note that confluent states have the property of a one-cycle delay, thus effectively holding two bits of data at any given time.




= Transmission state rules

=
The flow of bits between cells is indicated by the direction property. The following rules apply:

Transmission states apply the OR operator to inputs, meaning a cell in a transmission state (ordinary or special) will be excited at time t+1 if any of the inputs pointing to it is excited at time t
Data passes from cell A in an ordinary transmission state to an adjacent cell B in an ordinary transmission state, according to the direction property of A (unless B is also directed towards A, in which case the data disappears).
Data passes from cell A in a special transmission state to an adjacent cell B in a special transmission state, according to the same rules as for ordinary transmission states.
The two subsets of transmission states, ordinary and special, are mutually antagonistic:
Given a cell A at time t in the excited ordinary transmission state
pointing to a cell B in any special transmission state
at time t+1 cell B will become the ground state. The special transmission cell has been "destroyed".
a similar sequence will occur in the case of a cell in the special transmission state "pointing" to a cell in the ordinary transmission state




= Confluent state rules

=
The following specific rules apply to confluent states:

Confluent states do not pass data between each other.
Confluent states take input from one or more ordinary transmission states, and deliver output to transmission states, ordinary and special, that are not directed towards the confluent state.
Data is not transmitted against the transmission state direction property.
Data held by a confluent state is lost if that state has no adjacent transmission state that is also not pointed at the confluent state.
Thus, confluent-state cells are used as "bridges" from transmission lines of ordinary- to special-transmission state cells.
The confluent state applies the AND operator to inputs, only "saving" an excited input if all potential inputs are excited simultaneously.
Confluent cells delay signals by one generation more than OTS cells; this is necessary due to parity constraints.




= Construction rules

=

Initially, much of the cell-space, the universe of the cellular automaton, is "blank", consisting of cells in the ground state U. When given an input excitation from a neighboring ordinary- or special transmission state, the cell in the ground state becomes "sensitised", transitioning through a series of states before finally "resting" at a quiescent transmission or confluent state.
The choice of which destination state the cell will reach is determined by the sequence of input signals. Therefore, the transition/sensitised states can be thought of as the nodes of a bifurcation tree leading from the ground-state to each of the quiescent transmission and confluent states.
In the following tree, the sequence of inputs is shown as a binary string after each step:

a cell in the ground state U, given an input, will transition to the S (newly sensitised) state in the next cycle (1)
a cell in the S state, given no input, will transition into the S0 state (10)
a cell in the S0 state, given no input, will transition into the S00 state (100)
a cell in the S00 state, given no input, will transition into the S000 state (1000)
a cell in the S000 state, given no input, will transition into the east-directed ordinary transmission state (10000)
a cell in the S000 state, given an input, will transition into the north-directed ordinary transmission state (10001)
a cell in the S00 state, given an input, will transition into the west-directed ordinary transmission state (1001)
a cell in the S0 state, given an input, will transition into the S01 state (101)
a cell in the S01 state, given no input, will transition into the south-directed ordinary transmission state (1010)
a cell in the S01 state, given an input, will transition into the east-directed special transmission state (1011)
a cell in the S state, given an input, will transition into the S1 state (11)
a cell in the S1 state, given no input, will transition into the S10 state (110)
a cell in the S10 state, given no input, will transition into the north-directed special transmission state (1100)
a cell in the S10 state, given an input, will transition into the west-directed special transmission state (1101)
a cell in the S1 state, given an input, will transition into the S11 state (111)
a cell in the S11 state, given no input, will transition into the south-directed special transmission state (1110)
a cell in the S11 state, given an input, will transition into the quiescent confluent state C00 (1111)
Note that:

one more cycle of input (four after the initial sensitization) is required to build the east- or north-directed ordinary transmission state than any of the other states (which require three cycles of input after the initial sensitization),
the "default" quiescent state resulting in construction is the east-directed ordinary transmission state- which requires an initial sensitization input, and then four cycles of no input.




= Destruction rules

=

An input into a confluent-state cell from a special-transmission state cell will result in the confluent state cell being reduced back to the ground state.
Likewise, an input into an ordinary transmission-state cell from a special-transmission state cell will result in the ordinary-transmission state cell being reduced back to the ground state.
Conversely, an input into a special transmission-state cell from an ordinary-transmission state cell will result in the special-transmission state cell being reduced back to the ground state.




See also


Codd's cellular automaton
Langton's loops
Von Neumann universal constructor
Wireworld




References


Von Neumann, J. and A. W. Burks (1966). Theory of self-reproducing automata. Urbana, University of Illinois Press. [1]




External links


Golly - supports von Neumann's CA along with the Game of Life, and other rulesets.

Kata Kunci Pencarian:

• John von Neumann
• Daftar masalah matematika yang belum terpecahkan
• Von Neumann cellular automaton
• Cellular automaton
• Von Neumann machine
• Codd's cellular automaton
• Von Neumann universal constructor
• Von Neumann neighborhood
• List of things named after John von Neumann
• Langton's loops
• John von Neumann
• Conway's Game of Life