Rule 110

Abstract. An interactive simulation of Wolfram's Elementary Cellular Automaton Rule 110. This rule is notable for its "Class 4" behavior—neither completely stable nor completely random—and has been proven to be Turing Complete.

Simulation Control

Initial State ($t=0$)

Manual Binary (0s & 1s)

Parameters

Speed Max

Cell Scale 1px

Visuals Alive State ($1$) Dead State ($0$)

Fig 1. Space-time diagram of Rule 110 evolution. Time flows downwards.

f(1,1,1)=0, f(1,1,0)=1, f(1,0,1)=1 ...