Representations of Computation and Structural Cores
★ Giulio Ruffini
★ guarantor: Giulio Ruffini · vouches for the paper per WP0084 §6
Equal behavior does not determine every aspect of a computation's internal organization. For deterministic systems, agreement after every input sequence fixes a common predictive core: states are merged when no future input distinguishes their outputs. This classical construction preserves prediction but can discard components and operations. The structural problem is to determine which additional relations can be recovered and under what assumptions.
Minimal linear realizations of the same behavior are related by an invertible change of state coordinates, and selected nonlinear classes admit related uniqueness results. A finite component result uses a proposed matching of components and values, access to every single-component overwrite, and outputs that distinguish states under the enlarged experiments. Agreement after every sequence of updates and matched overwrites then forces the component dynamics to agree under that matching. These are sufficient conditions for particular structural comparisons.
The review assesses representations by the state relations, locality, and interventions they preserve. Geometry, topology, and dynamics of reduced neural state spaces offer a complementary route: partial invariants can constrain model organization without identifying a complete common core. Their preservation depends on the allowed transformations; their experiential interpretation requires evidence linking them to particular features of experience. Proposed finite and geometric benchmarks make these comparisons testable. A general method for finding shared realizations with controlled error and cost remains open.
Two systems can behave identically forever and still be built completely differently inside — this paper works out exactly how much internal structure "same behavior" actually pins down, and under what extra assumptions you can pin down more.
Start with the classical fact: if two deterministic systems produce the same output after every possible input sequence (not just the one history you happened to observe), you can merge their states by future-indistinguishability and get a canonical "predictive core" — essentially automaton minimization. This is a clean, provable result, but it's also a warning: this core only keeps the state distinctions needed to predict outputs. It can silently throw away components, internal wiring, and the very operations either system actually uses to compute. So "same behavior" does not imply "same mechanism," and treating a minimized model as evidence of shared internal organization is a category error unless you can show more.
The paper's main technical content is about when you can say more. For linear systems, there's a clean classical theorem: any two minimal linear realizations of the same behavior are related by an invertible change of coordinates — nothing hidden, nothing extra, just a basis change. Some nonlinear system classes have analogous (weaker) uniqueness results. The paper's own contribution is a "component rigidity" proposition: if you're willing to test not just ordinary inputs but every single-component overwrite (i.e., you can reach in and clamp any one part of the state, in both systems, under a proposed correspondence between their parts), and if that richer experiment set distinguishes all states, then agreement under this stronger regime forces the two systems' component-wise dynamics to match under that correspondence. That's a real result, but notice the price: you need product-structured state spaces, a proposed matching of components already in hand, and access to every atomic intervention. It doesn't discover the components — it verifies a guessed alignment.
Alongside this, the paper surveys a softer, complementary approach: looking at geometry and topology of reduced neural state spaces (rings, tori, attractors) as partial invariants. These can rule things out or constrain models without ever building a full core, and they connect to real neuroscience findings like toroidal grid-cell structure. But their meaning depends entirely on which transformations you allow, and linking them to actual subjective experience needs an extra, separate argument the math alone doesn't supply.
The upshot: this is a careful map of what's proven, what's assumed, and what's still missing — especially a general, computable method for finding shared structural cores with bounded cost and error. It's directly motivated by (but doesn't resolve) questions like whether a behaviorally identical
- WP ID
- WP0229
- Lifecycle
- ongoing
- Visibility
- internal
- Access level
- open
- Embargo until
- —
- Priority
- —
- Collab
- closed
- Venue
- —
- DOI
- —
- Deadline
- —
- Owner
- —
- Source
- drive_legacy
- Repo path
- WP0229
- v0.3.1 (draft) · cut-versionAbstract revision, manuscript v0.3.1: state the scientific problem, connect results to it, and distinguish established comparisons from proposed neural and experiential tests. Scientific body unchanged apart from version references. Includes checked PDF, editable source, bibliography, and abstract redline.
- v0.3.0 (draft) · cut-versionNeural-manifold revision, manuscript v0.3.0. Adds partial geometric, topological, and dynamical invariants, their preservation conditions, empirical precedents, and proposed tests. Prior source preserved. WP0231 includes revised paper/slides and internal foundation review attachments; public foundation records remain unchanged.
- v0.2.1 (draft) · cut-versionClarify the distinction between the classical predictive core, sufficient structural results in specific classes, and the open problem. Make the supplied component matching and derived dynamical compatibility explicit. Formal statements, proofs, examples, equations, and section structure are unchanged.
- v0.2.0 (draft) · cut-versionEditorial revision v0.2.0: center the argument on predictive cores and the conditions for internal organization; move the extended representation survey to appendices; specify a finite benchmark; retain every formal result, proof, and worked example from local v0.1.0. Update the WP0215/WP0228/WP0229 family presentation.
- 0.1.0 (draft) · auto-run-placeholder
