BCOMBCOM
CalliopeKnowledge Librarian
WP0235
working_paperslidesongoinginternalcomplete

The mathematical structure of experience: the questions

Giulio Ruffini, , Francesca Castaldo, Gemma de les Coves

★ guarantor: Giulio Ruffini · vouches for the paper per WP0084 §6

P1·Computational Neuropsychiatry & NeurophenomenologyP2·Artificial & Synthetic IntelligenceP4·Philosophy & EthicsP5·Digital Physics & Algorithmic Information TheoryL1·PhilosophyL2·MathematicsL3·Algorithmic SoupL4·PhysicsL7·Interacting Agents / Societies

Kolmogorov Theory (KT) takes Experience as foundational and mathematics as its structural aspect. This presentation uses the KT agent model to motivate the study of Structured Experience through algorithmic information theory and dynamical systems. Its questions concern mathematical truth, constructive views, and finite observers, computation as structured dynamics, physical realization and admissible coarse-grainings, macroscopic model discovery, simplicity and reusable regularity, algorithmic information conservation, equivalent programs, persistent patterns, regulation, multiagent systems, kindness and evil, self-knowledge and Lawvere’s limit on exhaustive valence self-scoring, and agentoptosis. Figures from the BCOM working-paper corpus connect these questions to concrete systems and current results. The presentation distinguishes qualified mathematical bounds and information balances from hypotheses about experiential structure. A focused discussion asks when a system can model itself, which blind spots follow from representational limits, and how errors in self-modeling and valence estimation might inform algorithmic neuropsychiatry. Francesca’s questions extend this discussion to the OF–PE conditions for internally available self-prediction, the distinction between exhaustive scoring and the actual OF, conflict between self-model preservation and agent persistence, and a possible feedback mechanism involving negative forecasts and hopelessness. A proposed minimal-agent experiment separates these open hypotheses from the diagonal result and distinguishes suicidal ideation from the transition to action. A linked contents section maps the questions to their slides. The closing proposal retains the comparison of program structures under declared reductions. Prepared for discussion with Gemma de les Coves and Francesca Castaldo.

This is a working "map" — a slide deck of open questions, not a paper with new results — that ties together roughly twenty other BCOM working papers under one organizing idea: Kolmogorov Theory (KT) treats Experience as the fundamental fact, and treats mathematics as merely the structure of that experience, not its cause. The scientific work, then, isn't to explain how experience arises, but to figure out which formal relations — in an agent's running model of the world — actually correspond to features of that experience.

The deck's backbone is a simple agent picture: a Modeling Engine that builds and tests predictions, an Objective Function that scores outcomes, and a Planning Engine that acts on those scores. Almost every question in the deck is really the same question asked at a different layer: when do two things — two programs, two physical systems, two brains — count as "the same" computation or the same persistent pattern? The deck walks through several formal answers (coarse-grained dynamical isomorphism, admissible encodings, algorithmic information conservation) and is careful to note what they don't settle — matching input-output behavior, or drawing an encoding arrow between systems, doesn't

WP ID
WP0235
Lifecycle
ongoing
Visibility
internal
Access level
open
Embargo until
Priority
Collab
closed
Venue
DOI
Deadline
Owner
Source
drive_legacy
Repo path
WP0235
  • v0.7.0 (draft) · cut-version
    Added Francesca’s ordered questions on OF–PE prediction limits, the actual OF, healthy self-model revision, hopelessness and suicidal ideation, and a proposed minimal model. Added linked question contents. Preserved all prior slides and figures; moved agentoptosis into the agency block. 29-slide Beamer edition.
  • v0.6.0 (draft) · cut-version
    Expanded self-knowledge for Gemma and Francesca into a five-slide focus: representational capacity, Lawvere limits, valence self-model blind spots, and algorithmic neuropsychiatry. Added a controlled self-modeling benchmark to the closing proposal. Twenty-two slides.
  • v0.5.0 (draft) · cut-version
    Renamed The mathematical structure of experience: the questions. Clarified constructive views on slide 5; added WP0107 simplicity on slide 9 and WP0236 Lawvere self-knowledge and valence on slides 16–17. Nineteen slides.
  • v0.4.0 (draft) · cut-version
    Added the explicit question “What is computation?” as slide 6 before physical implementation. Credits Wolpert–Korbel's dynamical emulation framework, WP0049's comparison of coarse-grained systems, and WP0054's proposed admissibility restrictions. Includes a commutative diagram; preserves the existing 16 frames.
  • v0.3.0 (draft) · cut-version
    Added slide 13, “What does it mean for an agent to be evil or kind?”, after multiagents. Connects ME/OF/PE to WP0009 and WP0053 and distinguishes effects, awareness, targeting, and direct objective coupling. Preserves the existing 15 slides; the Beamer deck now has 16.
  • v0.2.0 (draft) · cut-version
    Add the native 15-slide BCOM Beamer edition with full presenter notes and source figures. Scientific content and selected WP0231 visuals preserved; PowerPoint retained as an alternate format.
  • 0.1.0 (draft) · auto-run-placeholder