Elementary Nearest Ambidextrous Automata

Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
Elementary rules return one output bit for three input bits. It is thus possible to apply such rules to any context that expects one output bit for three binary inputs. This kind of generalization is illustrated by a system which evolves arbitrary real positions by inverting a binary state value for each position according to its previous state bit and those of its two nearest neighbors.
[more]
Contributed by: Michael Schreiber (March 2011)
Open content licensed under CC BY-NC-SA
Snapshots
Details
detailSectionParagraphPermanent Citation
"Elementary Nearest Ambidextrous Automata"
http://demonstrations.wolfram.com/ElementaryNearestAmbidextrousAutomata/
Wolfram Demonstrations Project
Published: March 7 2011