Machine-Native ReasoningReading edition

83. Decomposition, coarse-graining, and robust relationality

Reading tools
Reading library

Saved reading

Read side by side

Loading chapter…
Resources & source
PDF and editable source · Chapter source · About this edition

Relationality is always assessed relative to a way of dividing a realization into components. That dependence is not a minor technicality. If every participant, artifact, and channel is merged into one component, the complete workspace becomes local by definition. If a centralized state is recoded into several complementary shares, the same centralized process can be made to look irreducibly distributed. A defensible theory must therefore say which partitions count as admissible, which quantities survive faithful aggregation, and how sensitive a certificate is to alternative descriptions of the same system.