W110

This article is not detailed enough and needs to be expanded. Please help us by adding some more information.

W110 (or Wolfram's rule 110) is a 1D Cellular automaton proven to be Turing-complete. Its name is derived from how each cell's state is determined.

Computational class

W110 has been proven to be Turing-complete as it can implement a cyclic tag system.