Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Parity Problem With A Cellular Automaton Solution   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} (N^2)$ time.

27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
32
The categories of this paper are: atom-ph
31
The categories of this paper are: ao-sci
24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
25
The categories of this paper are: patt-sol
5
The categories of this paper are: gr-qc
0
The categories of this paper are: hep-ph
19
The categories of this paper are: eess
15
The categories of this paper are: nucl-ex
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
28
The categories of this paper are: alg-geom