Solving the parity problem in one-dimensional cellular automata (Q272769)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6571383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the parity problem in one-dimensional cellular automata |
scientific article; zbMATH DE number 6571383 |
Statements
Solving the parity problem in one-dimensional cellular automata (English)
0 references
21 April 2016
0 references
elementary cellular automata
0 references
emergent computation
0 references
parity problem
0 references
density classification
0 references
de Bruijn graphs
0 references
0 references
0 references
0.8901974
0 references
0.8841455
0 references
0.8829104
0 references
0.8661227
0 references
0.8502572
0 references
0.84902126
0 references
0.84849536
0 references
0.84711236
0 references
