Project: The Effect of Long-Distance Cellular Automaton on the Network of Expected Outcomes

A cellular autamaton (CA) is defined by Wolfram MathWorld as “… a collection of ‘colored’ cells on a grid of specified shape that evolves [iteratively] through a number of discrete time steps according to a set of rules based on the states of neighboring cells.” This project aims to determine the effect that modifiying the behavior of a CA on an elementary scale has on the characteristic of said CA. More specifically, instead of determining the resultant node of the CA from three adjacent nodes, the set of rules will be applied to a long-distance set of input nodes; ergo, this type of modified CA is referred to as a long-distance cellular automaton (LDCA). The move from CA to LDCA will most likely affect the networks of the function, and will certainly change the graphics of the CA’s behavior.

Favorite Four-Color, Four State Turing Machine

Rule 647279942394663485403170