9711

Mobile Automaton with Memory

A mobile automaton consists of a row of cells with two possible colors for each cell (black or white), with a single "active cell". The rule specifies the updated color for the active cell, based on its current color and that of its left and right neighbors. In addition to updating the color, the rule specifies whether the active cell should move right or left at each step. (To show where the active cell is at each time step, a black active cell is shown as a red cell, and a white active cell is shown as a blue cell.)
This Demonstration lets you explore a mobile automaton with memory. Here, memory means the color of the active cell is taken not from the current step, but from a given number of time steps in the past. Memory zero is the regular mobile automaton case. With a memory of one, the color of the active cell is taken from the previous time step, and so on. The rule is summarized by the rule table below the time evolution. The memory is shown in an icon on the right-hand side of the rule table.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

The mobile automaton rule is controlled by separately setting the rules for the color update and the active cell movement (both independently range from 0 to 255), giving a total of possible rules. The memory can be chosen independently, from zero to 30, for any given rule.
A mobile automaton with memory requires an initial condition with rows.
Mobile automata with memory were first studied as abstract computational systems at the 2011 New Kind of Science Summer School. To date, nothing beyond purely repetitive (class 1) and nesting (class 2) behavior has been observed in two-color mobile automata, with or without memory (see page 71 of A New Kind of Science). That is, there are as yet no known cases where adding memory increases the complexity of a two-color mobile automaton rule. Adding memory does tend to cause interesting transients to occur, however. For example, an interesting transient occurs for rule {43,22} with memory 6, starting from a blank initial condition.

RELATED LINKS

    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.









 
RELATED RESOURCES
Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2014 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+