Elementary Cellular Automata as Multiplicative Automata
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915160543723520 |
|---|---|
| author | McKinley, Daniel |
| author_facet | McKinley, Daniel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_13360 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Elementary Cellular Automata as Multiplicative Automata McKinley, Daniel Cellular Automata and Lattice Gases Discrete Mathematics 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. |
| title | Elementary Cellular Automata as Multiplicative Automata |
| topic | Cellular Automata and Lattice Gases Discrete Mathematics |
| url | https://arxiv.org/abs/2502.13360 |