The basis for most of the ideas mentioned in this paper is the theory of
cellular automata. A cellular automata contains a regular grid of cells, with
each cell having a pre-defined set of finite states. The initial state is
determined at time/state zero. At this point all the cells are assigned their
respective starting states. The automata is defined by a set of simple rules
that decide the subsequent states of the cells. We aim to create a cellular
automata of prime numbers and come up with some axioms, theorems and
conjectures for the same