2025/02/19 by Daniel McKinley, McKinley, Daniel
Computer Science · #Cellular Automata and Applications #Cellular Automata and Lattice Gases (nlin.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2502.13360
openalex publication_date 2025/02/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.