Two-States Bilinear Intrinsically Universal Cellular Automata

Linear cellular automata have been studied in details using algebraic techniques [3]. The generalization to families of polynomial cellular automata seems natural. The following step of complexity consists of bilinear cellular automata which study has begun with the work of Bartlett and Garzon [2]. Thanks to bulking techniques [5], two-states bilinear intrinsically universal cellular automata are constructed. This result answers a question from Bartlett and Garzon [2] of 1995.