jaysonhwang / cellular_automation Goto Github PK
View Code? Open in Web Editor NEWIn mathematics and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states (labeled 0 and 1) and the rule to determine the state of a cell in the next generation depends only on the current state of the cell and its two immediate neighbours. As such it is one of the simplest possible models of computation.