The Rule 110 cellular automaton, often called simply Rule 110, is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect it resembles Conway's Game of Life: like the Game of Life, Rule 110 with a particular repeating background pattern is known to be Turing complete, meaning that, in principle, any calculation or computer program can be simulated using this automaton.
Facts
Connections
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Rule 110 - Wolfram MathWorld
Overview (first paragraph)Quote, Overview (first paragraph)
Rule 110 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.