Rule 184¶
A synchronous binary cellular-automaton rule whose local update moves each unblocked occupied site one step right while conserving occupancy on a ring.
Core Idea¶
Rule 184 is an exact one-dimensional cellular-automaton update, not a general name for traffic. Each site has state 0 or 1. At every step all sites use their old left, center, and right states to compute the new center state. For a neighborhood (a,b,c), the rule is f(a,b,c) = (b AND c) OR (a AND NOT b). In descending neighborhood order 111, 110, 101, 100, 011, 010, 001, 000, its outputs are 1, 0, 1, 1, 1, 0, 0, 0: binary 10111000, decimal 184.[1]
Reading 1 as a vehicle and 0 as an empty road cell, an occupied cell moves one position right when the next cell is empty, while a blocked vehicle waits. On a periodic ring the number of 1-cells is conserved. Belitsky and Ferrari also relate this exact update to ballistic-annihilation and deterministic surface-growth dynamics through explicit recodings. Those readings are useful, but they do not replace the binary rule that defines the entry.[1][2]
Structural Signature¶
- Carrier: a one-dimensional lattice with a binary state η(i)∈{0,1} at each site. A finite ring needs periodic boundaries; on an infinite line counts and flux require their own interpretation.[1][2]
- Local condition: the old triple (η(i−1),η(i),η(i+1)). Radius one and the eight outputs above are part of the named rule; a neighboring rule with another table is not Rule 184.[1]
- Global transition: apply the same f to every site simultaneously, then repeat. Reading updated neighboring values during the same sweep would give a different dynamics.[2]
- Derived conservation: in the vehicle reading, a 10 pair becomes 01 by a parallel rightward move and 11 blocks the rear vehicle. A ring does not create or remove vehicles. Conservation helps recognize the dynamics, but conservation alone is shared by other rules and cannot define it.[1]
The local table is the constitutive operation. Vehicle flow, density-dependent flux, and surface growth are consequences or interpretations under stated conditions, not extra table entries.
What It Is Not¶
Rule 184 is not any model in which objects move right. Probabilistic hopping, different neighborhoods, sequential updates, lane changes, and vehicle acceleration alter the transition law. It is not a calibrated prediction that every real road forms a jam. Traffic is a mathematical reading of its binary states.[1][2]
It is also not a perfect density classifier by itself. Fukś's exact construction uses Rule 184 followed by a different majority rule, Rule 232. Attributing the result to Rule 184 alone removes a necessary part of that construction.[1]
The surface-growth and annihilation representations do not preserve the same counted objects. The 1-cells of the original automaton are conserved on a ring; annihilation particles can disappear, and a growing surface gains material. Equating a 1-cell with a deposited grain or an annihilating particle would confuse distinct state spaces.[2]
Scope of Application¶
The rule applies to binary one-dimensional synchronous cellular automata. It supports deterministic exclusion-style traffic models, analysis of particle flow and density regimes, and source-bounded mappings to other discrete processes. These are mathematical models. The behavior of a particular road, physical growth process, or stochastic particle system requires additional assumptions and evidence.[1][2]
Belitsky and Ferrari map the automaton state η to a signed ballistic variable ζ(i)=1−η(i)−η(i+1), then integrate successive signed values as surface slopes. Their mapping intertwines the specified updates on its image, and the surface correspondence tracks shape up to a vertical offset. It does not identify every annihilation configuration with a Rule 184 state. More subtly, the two bi-infinite alternating η states both give ζ≡0 under the displayed formula, so the map is not globally one-to-one on that stated domain even though their Remark 1.1 calls it injective.[2]
Clarity¶
The truth table resolves what a verbal “cars advance” description can leave uncertain. All cars decide from the same time slice. A car facing a 0 advances one cell; a car facing a 1 stays. For example, the local neighborhood 110 has new center 0 because its old center moves right, while 011 has new center 1 because the old center remains blocked by its right neighbor. Neither result depends on an informal ordering of cars.[1]
The notation “184” is the decimal value of the eight output bits in Wolfram's neighborhood order. It identifies a rule, not an observed traffic quantity. A different local table can share a traffic metaphor without sharing this identity.[1]
Manages Complexity¶
The local equation permits exact reasoning about a global space-time pattern without assigning independent behavior to each vehicle. A finite periodic lattice conserves its 1-count even while occupied sites change position. Distinguishing count from flux prevents the mistaken inference that conservation means no movement.[1]
The recodings add a second layer of control. In the original automaton, 1 means occupancy. In the ballistic representation, signed values describe differently moving defects. In the surface representation, integrated signed values describe successive slopes and local-minimum growth. The explicit transformations let results about shape or defects illuminate the rule, while their image restrictions and lost height offset prevent claims of literal identity between every state in all three systems.[2]
Abstract Reasoning¶
To decide whether a proposed process is Rule 184, obtain its binary local update for all eight triples and check both the table and simultaneous iteration. To apply the traffic reading, also specify boundary conditions and what a 1 represents. On a finite ring, count conservation follows from movement into gaps; with open boundaries, entry and exit flux must be included.[1]
To transfer a theorem from a recoding, write the map and its domain. The formula ζ(i)=1−η(i)−η(i+1) intertwines the CA and annihilation updates on image states; it neither covers all annihilation states nor distinguishes the two alternating CA sequences. The integrated surface is determined up to a vertical constant. These limits matter when reversing an inference from the surface back to the original binary state.[2]
Knowledge Transfer¶
The traffic reading teaches the rightward exclusion update: a 1 can move only into an adjacent 0, with every decision made in parallel. The same binary evolution can be studied through a signed-defect representation and then as the changing shape of a piecewise-linear surface. What transfers is a mathematically mapped update, not a claim that a road cell is a grain or that physical cars annihilate.[1][2]
A result tied to one reading must carry its extra conditions. For example, the flux formula for extremal translation-invariant invariant measures is a model statement about a specified stationary regime. It cannot be substituted for transient flux from an arbitrary initial pattern, for an arbitrary mixture of stationary measures, or for measured traffic throughput.[2]
Examples¶
Vehicle-gap automaton. Let η be a binary periodic road lattice, with 1 an occupied vehicle site and 0 a gap. At each step every vehicle with a gap to its right advances one site. A blocked vehicle stays. The count of vehicles is fixed, though their positions change. This is the direct traffic interpretation of the exact eight-entry Rule 184 table, not a claim that it captures acceleration, driver variation, or multilane roads.[1][2]
Surface-growth shape through recoding. Start with a bi-infinite Rule 184 state η. Belitsky and Ferrari form signed ζ(i)=1−η(i)−η(i+1), which follows their ballistic-annihilation update on the image of this map. Integrating ζ as neighboring slopes gives a piecewise-linear surface; a local minimum changes under the corresponding growth step. The preserved correspondence concerns shape after an additive vertical offset is ignored. Deposited material is not the conserved 1-count, and the map cannot represent every annihilation state or uniquely recover both alternating η states.[2]
Structural Tensions¶
Occupancy versus flow in a bounded stationary regime. In the extremal translation-invariant invariant measures analyzed by Belitsky and Ferrari, the model particle flux is J(ρ)=min(ρ,1−ρ). As density rises toward one half, more vehicles can contribute to flow; beyond one half, fewer gaps constrain rightward movement and the model flux falls. The same increase in occupancy therefore first helps and then hinders flow under those stated measures. This is a structural tradeoff of the exclusion update in that regime, not a universal flux law for every initial state or an empirical road curve. The diagnostic is the density and whether the chosen measure is one of the extremal invariant measures to which the formula applies.[2]
Structural–Framed Character¶
Formal structure: Rule 184 has a fully specified binary carrier, local truth table, and synchronous transition. Evaluative weight: its membership is mathematical, not praise for traffic efficiency. Human-practice dependence: people choose readings and measurements, but the eight-bit update is independent of a road practice. Institutional origin: the number belongs to a cellular-automaton rule convention; that naming convention does not make actual roads part of the formal definition.[1]
Vocabulary travel: “vehicle,” “defect,” and “surface” carry different state meanings under the cited maps; their words cannot be swapped without the map. Import versus recognition: one recognizes Rule 184 in a new model by matching its exact transition, while calling any crowded system “Rule 184” merely imports a metaphor. Its character: structural-dominant domain-specific—the formal update is exact across its mathematical readings, but its defining binary one-dimensional table remains a specific automaton rather than a substrate-independent Prime.
Structural Core vs. Domain Accent¶
The skeletal relation is a local state rule producing a global run. The live Automaton parent includes that broader state-transition structure. The accepted edge is strict subsumption: Rule 184 is one kind of automaton, while many automata have other alphabets, neighborhoods, or input/acceptance semantics. A future Prime about local-to-global dynamics would need an independently evidenced residue beyond this exact eight-entry rule; the broad live Prime State and State Transition already captures part of that skeleton.
The domain-bound mechanism is the binary radius-one, one-dimensional synchronous update with outputs 10111000 in the specified order. Vehicles and gaps, ballistic defects, and surface slopes are local accents or mapped interpretations. The particle number conserved in one representation need not be conserved in another. The mapping restrictions are essential evidence for transfer, not optional details.[1][2]
The named entry does not clear the Prime bar. Remove its table and it becomes a broad automaton or state-transition claim already represented elsewhere; keep the table and it remains one formal rule. The traffic/surface pair proves that this domain-specific rule can be read in different models, not that a new substrate-independent mechanism has been isolated.
Instantiates / Related Primes¶
This entry is a kind of Automaton.
The accepted Automaton edge is strict child-to-parent subsumption because every Rule 184 run has formal states, a local transition, and synchronous global iteration. The parent does not inherit Rule 184's binary table. The Microscopic traffic flow model neighbor describes one model use; it is not a necessary genus of the exact rule because the surface recoding is not traffic. Quantum cellular automaton requires a different quantum carrier and evolution. The live Algorithm requires a finite problem-solving procedure with a result; an indefinitely iterated Rule 184 run need not halt.[1][2]
Relationships to Other Abstractions¶
Current abstraction Rule 184 Domain-specific
Parents (1) — more general patterns this builds on
-
Rule 184 is a kind of Automaton Domain-specific
Rule 184 is a specified cellular automaton with binary lattice states, local transitions, and synchronous runs.Every Rule 184 instance has a formal binary lattice state, a three-cell local condition, the exact Rule 184 transition table, and a global run formed by synchronous iteration. The live Automaton genus includes cellular automata and many other state-transition machines without this table or carrier. Thus Rule 184 is a strict kind of Automaton. The traffic and restricted surface-growth interpretations do not make traffic modeling or surface shape a necessary parent, and the edge is not a composition claim.
Hierarchy paths (2) — routes to 2 parentless roots
- Rule 184 → Automaton → Abstract Machine → Formal System → Formalization → Representation → Abstraction
Neighborhood in Abstraction Space¶
Rule 184 sits in a sparse region of the domain-specific corpus (66th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Condensed Matter & Many-Body Physics (16 abstractions)
Nearest neighbors
- Particle in a one-dimensional lattice — 0.84
- Dual lattice — 0.84
- Haefliger structure — 0.84
- Lattice Model (Physics) — 0.84
- Ewald summation — 0.84
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
Do not infer Rule 184 from visual traffic-like stripes, conservation alone, or a right-moving particle story without checking the eight local outputs and synchronous update. Do not attribute the Rule 184-plus-232 density classifier to Rule 184 alone. Do not treat the non-surjective and alternating-state-ambiguous annihilation map as a bijection, nor apply the extremal-measure flux formula to arbitrary stationary mixtures or physical road measurements.[1][2]
References¶
[1] Henryk Fukś, Solution of the Density Classification Problem with Two Cellular Automata Rules (1997), section II, Rule 184 table and traffic interpretation; abstract and section I for the Rule 184 plus Rule 232 classifier. arXiv:comp-gas/9703001. https://arxiv.org/pdf/comp-gas/9703001 registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q ↩r
[2] Vladimir Belitsky and Pablo A. Ferrari, Invariant Measures and Convergence for Cellular Automaton 184 and Related Processes (1998), introduction, Eq. (1.1), Assertions 1.1–1.2, Eqs. (1.3)–(1.4), Remarks 1.1–1.2, Theorem 2.2 proof (printed p. 7) for the alternating-state exception, and §2 extremal invariant-measure flux discussion (printed pp. 10–11). arXiv:math/9811103. https://arxiv.org/pdf/math/9811103 registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q