A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update (Q2215009)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update |
scientific article; zbMATH DE number 7284044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update |
scientific article; zbMATH DE number 7284044 |
Statements
A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update (English)
0 references
10 December 2020
0 references
cellular automata
0 references
asynchrony
0 references
deterministic update schedules
0 references
parity problem
0 references
emergent computation
0 references
0 references
0.84613436460495
0 references
0.8144940137863159
0 references
0.808272123336792
0 references
0.7965138554573059
0 references
