TY - JOUR
UR - https://doi.org/10.7287/peerj.preprints.2553v1
DO - 10.7287/peerj.preprints.2553v1
TI - Elementary cellular automata as conditional Boolean formulĂ¦
AU - Fleeman y Garcia,Trace
DA - 2016/10/24
PY - 2016
KW - cellular automata
KW - computational completeness
KW - boolean logic
AB -
I show that any elementary cellular automata -- a class of 1-dimensional, 2-state cellular automata originally formulated by Stephen Wolfram -- can be deconstructed into a set of two Boolean operators; I also present a conjecture concerning the relationship between the set of computationally complete elementary cellular automata rules (such as rule 110, shown in section 2 to be composed of a NAND gate) and the set of elementary cellular automata rules that contain universal Boolean operators (such as rule 52, shown in section 3.1 to contain a universal Boolean operator yet has not been shown as of 2016 to be computationally complete.)
VL - 4
SP - e2553v1
T2 - PeerJ Preprints
JO - PeerJ Preprints
J2 - PeerJ Preprints
SN - 2167-9843
ER -