Rule 30 automaton
About this app
Elementary cellular automata with all 256 rules: rule 90 jumps to any generation by formula, rule 30 must compute every step (irreducibility); plus a prediction game and an LLM's compute budget per token.
Simple rule, unpredictable pattern
An elementary cellular automaton is a row of cells that are on or off. Each cell in the next generation depends only on the three neighbours above it. For the eight possible neighbourhoods a rule fixes one output bit each; read as a binary number, this gives the rule number from 0 to 255. Rule 90 produces a Sierpiński triangle, and every cell can be computed directly from Pascal's triangle. Rule 30, by contrast, looks random, and no shortcut is known: to know generation 50 you have to compute all 50 steps. Stephen Wolfram calls this computational irreducibility.
What the app shows
A rule panel with the eight neighbourhood tiles, whose bits you toggle by clicking, plus the rule number in decimal and binary and the examples 250, 90, 30 and 110 for regular, nested, random and complex behaviour. The main automaton grows generation by generation from one cell or a random row, and a counter shows the steps computed. For comparison Rule 90 fills all rows by formula in zero steps. Another panel carries this over to language models: a network of fixed depth manages only a limited number of computation steps per token.
Try it yourself
Before the run, guess whether a marked cell in generation 50 will be on or off. Over many rounds your hit rate stays around 50 percent, because there is no pattern to learn. Press “Shortcut?” to pit Rule 90 against Rule 30, and set in the LLM panel how many steps one token can manage.
Frequently asked questions
- What is Rule 30?
- Rule 30 is an elementary cellular automaton with the rule: new cell = left XOR (centre OR right). From a single black cell it grows a pattern whose centre column looks so random that Mathematica long used it as a random number generator.
- What does computational irreducibility mean?
- A process is computationally irreducible if there is no faster way to its result than computing it step by step. For Rule 30 no formula is known that gives generation n directly. Rule 90, by contrast, is reducible: every cell follows from binomial coefficients modulo 2.
- How is the rule number of a cellular automaton formed?
- Write down the eight neighbourhoods from 111 to 000 in order and note for each whether the new cell is on (1) or off (0). These eight bits, read as a binary number, are the rule number. For Rule 30 that is 00011110.
- What does the Rule 30 app have to do with language models?
- A language model has a fixed number of layers and can do only a limited amount of serial computation per generated token. An irreducible computation like Rule 30 therefore needs many tokens of step-by-step work or a tool that runs code. The app's LLM panel works this out for an adjustable number of steps per token.
Subject: Computer science
More from Computer science
- Ackermann function
- Elevator simulator
- Binary workshop
- Binary versus linear search
- The Collatz problem
- Inside a CPU
- Swap the inside
- One frame in 16 milliseconds — how a game engine renders an image (3D)
A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps