3 research outputs found
Parity Problem With A Cellular Automaton Solution
The parity of a bit string of length is a global quantity that can be
efficiently compute using a global counter in 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 binary, uniform, parallel and deterministic
cellular automata applied in succession for a total of time.Comment: Revtex, 4 pages, final version accepted by Phys.Rev.