On the Dynamics of a Family of 2D Finite Cellular Automata
摘要
Our objective with this work is to challenge the concept of complexity. To achieve this, we introduce a two-dimensional finite family of cellular automata, which is simpler than those traditionally studied, and for which we can establish certain results regarding their admissible dynamics. Despite their simplicity, we demonstrate that some of these cellular automata exhibit dynamics that can be considered complex.