Parity Problem With A Cellular Automaton Solution
Abstract
The parity of a bit string of length N is a global quantity that can be efficiently compute using a global counter in O (N) time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any global counter? Here, we report a way to solve this problem using a number of r=1 binary, uniform, parallel and deterministic cellular automata applied in succession for a total of O (N2) time.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.