A declared controller, not a state-dependent compiler

The label $g$ contains every classical variable used to select subsequent operations. A typical label is

where $\gamma$ denotes geometric data.

An operation table may depend on $g$, but not on an undeclared functional of the current unknown density operator. Adaptive measurement control is represented by recording the outcome in a classical successor label. If a finer outcome affects future choices, it must remain in the controller state even when a coarser geometric report is displayed.

For a fixed finite horizon, any finite instruction tree can be made Markovian by adjoining its node or relevant history to the label. This may require exponentially many labels. No bounded-memory claim for arbitrary horizons is implied.