Realizability of Parity Logic in Finite Cellular Automata
Celestine Lawrence · Complex Systems · 2024
We investigate a range-4 cellular automaton that was designed and (falsely) proven to realize the parity logic for any odd input size N.We find that it fails to perform at N 13 and provide a Boolean bottleneck conjecture to redirect research efforts.