STRATA
Skip to study
XLVII

SOURCE RECORD / 1983

Local rules, global patterns

DocumentedR01 · 2026-11-18
Scope of this record

KNOWN refers to the mathematical systems investigated in the source. Their existence does not establish that spacetime is a cellular automaton.

Statement

Wolfram investigates discrete cellular-automaton dynamics, where local update rules can produce varied large-scale behavior from specified initial conditions. [source]

Equation

Unrecorded

The connection is scoped to this source. No broader cross-domain equality is established by this entry.

Observation

The source studies binary-state systems with local interactions and examines their emergent behavior. Rules and initial conditions are part of the specification rather than incidental display choices. [source]

Progressive questions

Which boundary convention is used? Does a pattern survive a change of lattice width or seed? Is apparent irregularity a tested computational property or simply a visual impression?

Source response

The abstract treats cellular automata as discrete dynamical systems suitable for statistical investigation. It does not license an inference from a pattern on a screen to the ontology of the universe. [source]

Interpretation

XLVII reading: a small automaton is valuable precisely because its complete rule table can be inspected. The same visible pattern can be replayed while the broader physical interpretation remains open.

Conclusion

The reusable object is an explicit finite rule system with reproducible evolution. [source]

Next experiment

Proposed extension: export the Observatory’s full state grid together with rule, seed and periodic-boundary convention. Verify the update table independently and examine finite-size recurrence. A test of the implementation must remain separate from a proof about universal computation.

Work through a related example.

VIII.06 / Zuse, Fredkin, and cellular-automaton approaches

Run a reversible operation backward.

Use a controlled swap on three binary inputs. Record the input and output for every possible input combination and verify that each output identifies one input. Compare this with an operation that erases a bit, where multiple inputs collapse to the same output. The table makes logical reversibility visible without assuming a particular physical implementation.

VIII.07 / Wolfram: computational equivalence and multiway systems

Compare two rewrite orders.

Choose a very small rewriting rule and an initial graph. Enumerate two legal sequences of updates and record the resulting states. Ask whether they converge, remain distinct, or become equivalent under a stated rule. This isolates a question about update dependence before interpreting a large generated graph as geometry or physical time.

X.02 / Differential equations, stochastic processes, and dynamical systems

Distinguish a stable solution from a stable solver.

Simulate a damped oscillator with a small time step and then with a much larger one. Compare the energy trend and trajectory. If a physically damped model appears to gain energy only with the larger step, investigate numerical stability before proposing new dynamics. Then halve the step until the chosen observable converges.

Follow earlier and later work.

Before

  • Proposed connection · UNKNOWNPatterns from reaction and diffusion

    Editorial research connection to investigate; not a verified correspondence, causal lineage, or mathematical equivalence.

After

  • Proposed connection · UNKNOWNA deterministic substrate?

    Editorial research connection to investigate; not a verified correspondence, causal lineage, or mathematical equivalence.

Follow the chain
  1. Patterns from reaction and diffusion · 1 link away · UNKNOWN
  2. A deterministic substrate? · 1 link away · UNKNOWN
  3. What remains after coarse-graining? · 2 links away · UNKNOWN
  4. A small system, a divergent future · 2 links away · UNKNOWN
  5. Boundary and bulk · 2 links away · UNKNOWN
  6. The first gravitational-wave signal · 3 links away · UNKNOWN

Placement.

Technology

This entry records the cited source and a proposed next investigation. It makes no claim of historical abandonment, suppression, or independent reproduction.

Sources.

  1. Statistical mechanics of cellular automata

    Stephen Wolfram / Reviews of Modern Physics · 55, 601; DOI 10.1103/RevModPhys.55.601; abstract.

    Publisher abstract inspected; the complete classification and proofs were not reconstructed. Checked 2026-11-18.

Record history
  1. 2026-11-18 / R1 / SOURCE_SEEDED

    Source-limited editorial seed with explicit inspection scope. Research questions and proposed experiments are not executed results.