Turing Machines with Memory

2,2 TM rule

819

steps

53

initial head placement

1

wraparound

clear memory

add row

add column

initial conditions

evolution

1-13

14-26

27-39

40-52

A Turing machine (TM) uses an infinite tape with cells on it. At every update, a head, represented by a triangle, reads the color of the cell it is over, writes a color onto the same cell, and then moves either left or right.

A memory Turing machine looks back

n

steps to see what color the current cell was back then. Everything else stays the same compared to regular TMs. Turing machines with memory allow for more complex behavior than a regular TM.

Simply click on a cell under "initial conditions" to edit it, and then observe the Turing machine's reaction.