2000 character limit reached
Elementary Cellular Automata as Multiplicative Automata (2502.13360v1)
Published 19 Feb 2025 in nlin.CG and cs.DM
Abstract: Elementary cellular automata (ECA) are converted into multiplicative versions by using permuted n-dim Galois fields and octonion multiplication tables as binary pointers to each rule's Wolfram code truth table. This enables an extension of the binary ECA to complex numbers, identity solutions are found, produces a polynomial, and is implemented in Java.
Collections
Sign up for free to add this paper to one or more collections.