Crosswalk
How the four lock
Geometry supplies allowed relationships. Quantum thinking forces countable updates. Computers run models of those updates. Programs choose the rewrites — and synergy names what the rewrites produce beyond part-sums.
| Question | Geometry | Quantum | Computer | Programs |
|---|---|---|---|---|
| What exists? | Events + relationships (min. tetra) | Discrete packets / thresholds | Encoded state | Named structures & APIs |
| What can change? | Distortions of VE / associations in IVM | Jumps between levels | Legal transitions | Branching procedures |
| What is “more complex”? | Higher frequency, more systems | Larger integers of events | More state / resolution | Deeper composition |
| What surprises? | Global form from local bonds | Non-classical correlations* | Simulation ≠ world | Synergy / emergence |
| Lab on this site | VE / IVM | Frequency / quanta | ||
*Modern physics detail is not claimed as Fuller’s theorem; the shared theme is relational surprise beyond naive part lists.
One sentence each way
Geometry → Quantum: only countable modular slots make discreteness structural rather than decorative.
Quantum → Computer: updates must be budgeted; continuum theater hides cost.
Computer → Programs: running a model is empty without a chosen procedure and success criterion.
Programs → Geometry: procedures act on graphs of relationship; if the graph is wrong, the program optimizes fiction.
§ notes · whole-system reading
Synergetics 1 & 2 braid topology, energetics, and epistemology. This crosswalk is a teaching partition, not a claim that Fuller used these four English labels as a chapter scheme.
Technical · stack image
Graph (geometry) → discrete time / resource (quantum-ish) →
runtime (computer) → rewrite rules (programs) →
metrics of whole (synergy checks).