pith. sign in

arxiv: 1011.0313 · v1 · pith:TGSDIMXGnew · submitted 2010-11-01 · 💻 cs.DM · quant-ph

The fractal structure of cellular automata on Abelian groups

classification 💻 cs.DM quant-ph
keywords automatastructurefractalcellulardiagramsspacetimeclassp-fermat
0
0 comments X
read the original abstract

It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. Explaining the fractal structure of the spacetime diagrams of cellular automata is a much explored topic, but virtually all of the results revolve around a special class of automata, whose typical features include irreversibility, an alphabet with a ring structure, a global evolution that is a ring homomorphism, and a property known as (weakly) p-Fermat. The class of automata that we study in this article has none of these properties. Their cell structure is weaker, as it does not come with a multiplication, and they are far from being p-Fermat, even weakly. However, they do produce fractal spacetime diagrams, and we explain why and how.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.