Reversible Multiplex of Totalistic Cellular Automata

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Multiplexed states encode multiple states of a cellular automaton's evolution as one state. This encoding is demonstrated with reversible second-order totalistic automata. The initial condition for such an automaton multiplexes two binary initial conditions into a four-color state. The upper plots show the initial multiplex between its past and future components. The lower plots show the step of the evolution between its relative past and future.

Contributed by: Michael Schreiber (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send