Dynamics, Algorithms, and Structured Experience: What Must a Brain Simulation Preserve?
★ Giulio Ruffini,
★ guarantor: Giulio Ruffini · vouches for the paper per WP0084 §6
What must a brain simulation preserve to share an experiential feature with a brain? Kolmogorov Theory takes Experience as foundational and mathematics as its structural aspect. Applying this proposal requires identifying the computational organizations physically realized by an agent and the relations that characterize their experiential structure. Memory, self-modeling, and report characterize particular forms of Structured Experience; they do not delimit it.
The first question is which computations a physical system realizes. Transformations and coarse-graining identify candidate states and operations. Exact closure requires the retained state and declared inputs to determine the next state; approximate descriptions need a stated domain and accuracy. Physical realization also requires the system to support the attributed states and transitions. Several such organizations can coexist without a uniquely privileged grain.
The second question is how their structures can be characterized and compared. The distinction between programs, algorithms, and functions separates shared behavior from shared procedures. Bounds on near-minimal programs constrain descriptions without selecting a common execution mechanism. Memory, dependencies, symmetries, and the geometry, topology, and dynamics of reduced neural state spaces supply candidate structural relations. Features preserved under specified transformations provide partial invariants that can constrain a comparison before a complete classification is known.
Within KT, a simulation shares an experiential feature when it preserves the realized relations constituting that feature. Which relations these are remains to be established. The comparison makes additional requirements, such as the causal partitions specified by Integrated Information Theory, explicit. Proposed tests using neural digital twins examine retention, access, and response to perturbation, separating evidence for a shared organization from evidence for its experiential interpretation.
A brain simulation can match every behavior and every brain scan of a person and still leave open whether it preserves what actually matters for shared experience — because "matching outputs" and "running the same computation" are different claims entirely.
This paper is BCOM's attempt to make that gap precise. Its background theory, Kolmogorov Theory (KT), takes experience as a basic fact about physical processes and treats mathematical structure as how that experience is organized — not something computation manufactures from scratch. If that's your starting premise, then the question "does a simulation share the person's experience?" reduces to: does it preserve the same organization the brain realizes? And that turns out to split into two genuinely hard problems, which the paper tackles with a string of small, concrete examples rather than hand-waving.
First: what computation does a physical system actually run? Not every way of summarizing a system's state gives you a valid "next state" prediction. The paper's spring example is the clearest illustration — two masses connected by a spring have a clean, closed description in terms of their center of mass (it just drifts, ignoring the spring entirely), and a different clean closed description in terms of the internal vibration. But an arbitrarily weighted average of the two masses' positions is not closed: two setups can have the same weighted average now and different weighted averages a moment later. So "coarse-graining" a system doesn't automatically give you a real computation running inside it — you have to check that the retained variables actually determine their own future (this is called dynamical closure), and that the physical system genuinely supports the states you're attributing to it, not just that your description happens to fit the data.
Second, harder problem: once you've identified an organization, how do you tell if two systems share it? The paper leans on a mathematician named Yanofsky's distinction between three things that get conflated: a function (input-output behavior), an algorithm (a procedure, up to some notion of sameness), and a program (the actual implementation). Two systems can compute the identical function while running utterly different procedures — the paper's toy example is a four-state counter and a two-state counter that both report the same parity bit forever, yet the four-state machine retains a distinction (which of two "even" phases it's in) that the two-state machine simply cannot express. Matching behavior at an interface doesn't tell you what's happening behind it. Similarly, Fourier-transforming a ring of coupled oscillators turns local, physically-connected sites into "independent" oscillating modes on paper — but that's just a change of coordinates, not evidence that the system is secretly built from separate mode-processors. Sameness of description is cheap; sameness of physically realized organization is not.
The payoff of grinding through this machinery is a sharper diagnosis of the classic thought experiments in philosophy of mind. Searle's Chinese Room and its brain-simulator variant, the "unfolding arg
- WP ID
- WP0215
- Lifecycle
- prospect
- Visibility
- internal
- Access level
- open
- Embargo until
- —
- Priority
- —
- Collab
- open
- Venue
- —
- DOI
- —
- Deadline
- —
- Owner
- giulio.ruffini@bcom.one
- Source
- drive_legacy
- Repo path
- WP0215
- v0.2.7 (draft) · cut-versionAbstract revision, manuscript v0.4.15: 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.2.6 (draft) · cut-versionNeural-manifold revision, manuscript v0.4.14. 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.5 (draft) · cut-versionManuscript v0.4.13, Git 668a392: targeted WP0228 v0.1.7 integration. Adds restricted nonlinear realization cases and source-transformation certificates. Preferred abstract, question headings, all 34 displays, figures, and tables preserved. Corpus semver differs from manuscript version.
- v0.2.4 (draft) · cut-versionManuscript v0.4.11: integrate supplied v0.4.10, restore explanatory bridges and hierarchy questions, incorporate WP0228 v0.1.5 distinctions between counts, certified reconstruction, structural classes and nontrivial shared factors. Preserve all received displays and formal results; redlines against v0.4.10 and v0.4.9.
- v0.2.3 (draft) · cut-versionManuscript v0.4.9: retain the valid open-ended-interaction objection, restrict the hierarchy correction to invariants of an already shared function, distinguish IIT's evidential challenge from refutation, and simplify prose. All formal results and figures unchanged.
- v0.2.2 (draft) · cut-versionManuscript v0.4.8: integrate WP0228 v0.1.3, distinguish structural uniqueness and diversity under specified economy criteria, and state the common-factor research question. All five figures and mathematical statements preserved. Corpus v0.2.2 maps to manuscript v0.4.8.
- v0.2.1 (draft) · cut-versionManuscript v0.4.7: plain-language abstract and main-text information bounds; driven and approximate closure, model/residual distinction, explicit unresolved structure/experience question, and Özkural 2014 antecedent. Corpus version v0.2.1 follows the previous manuscript v0.4.6 upload.
- v0.2.0 (draft) · cut-versionCorpus update containing manuscript v0.4.6 (September 12, 2026). Reframes the abstract around realized structure, structural equivalence, and bounded diversity; cites companion WP0228 for finite-output, total-function counting, and certified reconstruction results. Detailed AIT proofs moved to WP0228. Preserves the user-edited v0.4.5 baseline and all figures.
- 0.1.0 (draft) · auto-run-placeholder
