Cellular automata and communication complexity
This page illustrates the measurements done in the paper "Cellular automata and communication complexity" by C. Dürr, Ivan Rapaport and Guillaume Theyssier.
Visualize the identity card of rule
(enter Wolfram number between 0 and 255).
Summary of the classification given in the paper
$list[$i],\n"); } $listAdd = array(15, 51, 60, 90, 105, 108, 128, 136, 150, 160, 170, 204); $listLim = array(0, 1, 2, 3, 4, 5, 8, 10, 12, 19, 24, 29, 34, 36, 38, 42, 46, 72, 76, 78, 108, 138, 200); $listHalf= array(7, 13, 28, 140, 172); $listCst = array(27, 32, 130, 156, 162); $listLin = array(11, 14, 23, 33, 35, 43, 44, 50, 56, 58, 77, 132, 142, 152, 168, 178, 184, 232); $listOth = array(6, 9, 18, 22, 25, 26, 30, 37, 40, 41, 45, 54, 57, 62, 73, 74, 94, 104, 106, 110, 122, 126, 134, 146, 164); ?>
Bounded class
by additivity
by limited sensitivity
by half-limited sensitivity
by any other reason
Linear class
Other class