Graph View

rule 110

1 min read

Rule rule 110 is a turing complete elementary CA.

rule 110

Current pattern111110101100011010001000
New state01101110

Reading the next states as binary: 01101110 = 11010​

Link to original


Backlinks

  • elementary CA
  • rule 110
  • universal computation

Created with Quartz v4.5.2 © 2026