Abstract
It has recently been shown that no one-dimensional, two-state cellular automaton can classify binary strings according to whether their density of 1s exceeds 0.5 or not. We show that by changing the output specification, namely, the final pattern toward which the system should converge, without increasing its computational complexity, a two-state, r = 1 cellular automaton exists that can perfectly solve the density problem.
| Original language | English |
|---|---|
| Pages (from-to) | 4969-4971 |
| Number of pages | 3 |
| Journal | Physical Review Letters |
| Volume | 77 |
| Issue number | 24 |
| DOIs | |
| State | Published - 1 Jan 1996 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Physics and Astronomy