STRATA
Skip to study
XLVII

VIII.07 / QUANTUM FOUNDATIONS

Wolfram: computational equivalence and multiway systems

Which properties of a multiway system can be derived directly from its rewriting rules?

An open research question1 source references1 related experiments

Start with the question.

Wolfram's physics project studies graph-rewriting and multiway constructions as candidate ingredients for fundamental physics. The project's technical introduction is a primary statement of the program. Its visual richness makes explicit definitions especially valuable: a rule, initial state, update order, equivalence relation, and observable should be inspectable. A complex graph becomes scientifically informative when it supports a calculable claim under those definitions.

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.

What would you inspect?

  • Rewrite rule, initial condition, update choices, and equivalence criterion.
  • A defined observable and its behavior under changes of representation.

Take the next step.

Reconstruct one small example from the technical introduction and identify the additional argument needed to connect its graph property to a physical prediction.

Put part of the question to work.

These models isolate a mechanism you can vary. Their assumptions define the part of this topic they can illuminate.

Try connectivity and removal.

Change one parameter, compare the numerical output, and export the result. The experiment loads when you open it.

Open its full page

Watch the quantities change.

12 seconds · Original model visualization · Silent

Connectivity and removal

Compare local connections with the paths that hold a network together.

Read the explanation and method

Forty-eight points are drawn from one fixed random seed. A link joins two points whenever their distance is within the displayed radius.

The radius grows from 0.05 to 0.4 of the unit square. Existing links remain while new links merge previously separate connected groups.

Orange marks the largest connected group. Connectivity here describes paths through this constructed graph; it does not measure information quality, influence, or causality.

Method. Two nodes share an undirected edge when their Euclidean distance is at most the connection radius. After removal, a depth-first traversal assigns every active node to a connected component. Groups are ranked by size; ties use their lowest node identifier.

Read the supporting material.

  1. A Class of Models with the Potential to Represent Fundamental Physics

    Wolfram Physics Project · The proponents' graph-rewriting and multiway-system research program.

Continue through the versioned study records.