Abstract
Many classifications for Cellular Automata have been
proposed durng time. One of them is based on Langton
Parameter. Depending on the probability of a cell of
being active at one moment, Cellular Automata are
divided into four types.
We use Genetic Programming to obtain transition rules
with any desired value of Langton Parameter, in our
search of Cellular Automata capable of Universal
Computation.
Users
Please
log in to take part in the discussion (add own reviews or comments).