Structure is the controller.

Every running system holds state. A state machine, an entity-component system, a simulation engine, an operating system, an agent orchestrator — each is a particular shape of running state. Nine axes describe the shape. Position predicts what the system can do, and what it cannot.

c = ⟨ F, K, C, I, R, A, T, V, τ ⟩

The cell coordinate · nine axes, one tuple

Position predicts behavior.

A periodic structure earns its name when where a thing sits tells you how it behaves. For state, the dimensions are the formalism it is held in, how it composes, how it advances, where its boundary is, what triggers a step, what the machine knows of itself, what each transition costs, what can be checked about it, and how long it lives.

Read across the coordinate and the system explains itself — what it can express, what it can verify, what survives a restart, what it pays per transition in joules. The same map covers a finite-state machine, a hierarchical statechart, an entity-component system, an actor supervision tree, a Petri net, a DEVS simulation, a behavior tree, an operating-system kernel, a TLA⁺ specification, and an agent orchestration graph.

The map is a way of seeing, not a verdict. It classifies what runs, makes the structure of the design space legible, and lets a system be reasoned about before it is built — the same move the sibling stacks make for computation, information, synthesis, and data.

Nine axes describe a running system.

Two are shared with the sibling stacks — T inherits from the compute stack, V is shared with synthesis and data. The other seven are state-specific.

The addressable map.

The product of the axis cardinalities is the discrete coordinate space. Structural constraints prune it to an admissible remainder on which every running system has a place.

10 · 5 · 5 · 5 · 4 · 4 · 4 · 5 · 5 = 2,000,000

Discrete cell count · the addressable map of state-space

2,000,000

discrete cells

9

orthogonal axes

258

compute primitives below

One method, applied across fields.

The same axes recur. T inherits from the compute stack. V is shared with the synthesis and data stacks. A primitive carries consistent coordinates across all of them.