|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Parity Problem With A Cellular Automaton Solution | | K. M. Lee
; Hao Xu
; H. F. Chau
; | | Date: |
21 Feb 2001 | | Subject: | Cellular Automata and Lattice Gases; Adaptation and Self-Organizing Systems; Computational Complexity; Statistical Mechanics | nlin.CG cond-mat.stat-mech cs.CC nlin.AO | | 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} (N^2)$ time. | | Source: | arXiv, nlin.CG/0102026 | | Other source: | [GID 303090] pmid11497739 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER