diff --git a/conductor/tracks/video_analysis_generic_systems_fields_20260621/report.md b/conductor/tracks/video_analysis_generic_systems_fields_20260621/report.md
new file mode 100644
index 00000000..c722e9c5
--- /dev/null
+++ b/conductor/tracks/video_analysis_generic_systems_fields_20260621/report.md
@@ -0,0 +1,1719 @@
+# Interesting Behavior by Generic Systems
+
+**Source:** https://youtu.be/QeMajYvhEbI
+**Author:** Chris Fields (Allen Discovery Center collaborator; independent researcher)
+**Cluster:** C (Biological / cognitive / generic systems)
+**Slug:** generic_systems_fields
+**Track:** Child #7 of `video_analysis_campaign_20260621`
+**Date:** 2026-06-21
+**Pass:** 1 of 3 (research-only deep-dive)
+
+---
+
+## 1. TL;DR
+
+This talk presents a **physics-first framework** for understanding how generic systems exhibit interesting (intelligent) behavior. The author (Chris Fields, collaborator with Michael Levin on the Diverse Intelligence Project) argues that the Free Energy Principle (FEP) and related frameworks have a hidden assumption — the existence of "inert particles" that don't act back on the world — that violates Newton's third law. He proposes an alternative: start with quantum theory (the natural formalism for any **isolated** system), then introduce the boundary between a system and its environment as a **holographic screen** that implements state separability.
+
+The framework rests on four theorems that jointly establish the impossibility of fully predicting generic systems:
+
+1. **Moore's theorem (1956):** finite input-output experiments cannot uniquely determine the machine table (internal state-transition probabilities) of a generic classical Black Box.
+2. **Conway-Kochen "free will" theorem (2006, 2009):** special relativity + quantum theory together rule out local (past light cone) determinism. "If experimenters make choices, electrons do too."
+3. **Tipler singularity removal (2014):** the simplest formal removal of singularities from classical physics reproduces Bohm's "quantum potential."
+4. **Non-commuting Quantum Reference Frames (QRFs):** generate non-causal context dependence. Joint probability distributions on observational outcomes are undefined (violate Kolmogorov).
+
+The practical implication: **persistent observability** (the ability of a system to maintain its identity across interactions) is mathematically equivalent to **intelligence** (per William James: "a fixed goal achievable with variable means"). Quantum theory is the natural foundation for diverse intelligence — not because we need to build quantum computers, but because QT already gives us the right mathematical structure.
+
+The talk also presents **Marcel Blattner's 2026 work** on planarian bioelectric memory as a geometric/Berry-phase model — the bioelectric pattern memory discussed in Levin's talk is now formalized as **holonomy** in the bioelectric state space. This bridges Fields' abstract framework to Levin's biological model systems.
+
+**Cross-cluster position:** Sits in cluster C and bridges to clusters B (Platonic / generic — Levin's talk), A (math foundations — score_dynamics_giorgini's framework), and E (applied LLMs/diffusion — Moore's theorem applies to any sufficiently complex system including AI). The talk provides the **formal theoretical foundation** for the diverse intelligence project that Levin presented experimentally.
+
+---
+
+## 2. Key Concepts
+
+Twenty concepts form the conceptual spine of the talk. Each is developed in §5 with full mathematical statement.
+
+### 2.1 The Diverse Intelligence Project
+
+A research program (Levin, Resnik, Fields, and collaborators) that studies **intelligence across substrates** — biological, computational, physical. The project rejects the assumption that intelligence is a property of brains or nervous systems; it asks what any active agent has in common, regardless of composition.
+
+The methodological guidelines (per Levin & Resnik 2025, "Mind Everywhere"):
+1. Empirical testability (not philosophical commitment to linguistic categories).
+2. Fecundity in discovery of new capabilities (not just post-hoc explanations).
+3. Operationalization by reference to effective toolkits (cognitive/teleological claims are hypotheses of optimal interaction protocols).
+4. Continuity of human goal-directedness with unicellular origins (need for models of cognitive scaling).
+
+### 2.2 William James's definition of intelligence
+
+> "Intelligence is a fixed goal with variable means of achieving it."
+
+The working definition used in the diverse intelligence lab. Three questions it raises:
+- **Does any goal count?** "There's always at least one: continuing to exist as an entity."
+- **Are any means allowed?** "Whatever the internal dynamics HA and HÄ are capable of."
+- **Does anything fall outside this definition?** "No, it's completely generic."
+
+The definition is **deliberately permissive** — it includes any system that maintains its identity through variable means of self-preservation.
+
+### 2.3 Physics first, intuitions later
+
+The methodological commitment: derive the framework from physical principles, not from intuitions about inertness. The standard FEP framework classifies particles into "inert" and "active," but a system that doesn't act back on the world when the world acts on it **violates Newton's third law**. This is a problem at the foundational level.
+
+The alternative: derive the framework from quantum theory of an isolated system, then introduce the system-environment boundary.
+
+### 2.4 Generic systems
+
+A system is **generic** if it can be of any scale, structure, or composition, and the framework applies without modification. The opposite of generic is **specific** (e.g., a system with a particular composition, like a brain).
+
+The Diverse Intelligence Project studies generic systems because the question "what is intelligence" should not depend on the substrate. A generic framework applies to brains, embryos, robots, molecules, networks, and any future system.
+
+### 2.5 Quantum theory from isolation
+
+Start with an **isolated system** U (no environment, no interaction). The internal dynamics PU must respect Newton's third law everywhere. No sources, no sinks (because U has no environment). PU conserves momentum, energy, information (so is unitary).
+
+The technical term for conserving information is **unitarity**. Under unitarity, the dynamics is a linear operator on the state space. The state space can be made a Hilbert space (every possible value of every possible degree of freedom as a basis vector).
+
+In background time t, the propagator is:
+
+TU(t) = exp((-i/ℏ)·HU·t)
+
+where ℏ is a finite constant (action) and HU is the Hamiltonian (energy operator). A finite value of ℏ ⟺ no singularities.
+
+**This is quantum theory.** "Isolation is all you need."
+
+### 2.6 The boundary as holographic screen
+
+Once everything is linear, decompose the isolated system U into a system A and its complement Ä (everything else in U that isn't A). This introduces the **boundary** B between A and Ä.
+
+The linear decomposition of the Hamiltonian:
+
+HU = HA + HÄ + HAÄ
+
+where HA and HÄ are the internal Hamiltonians of A and Ä, and HAÄ is the interaction.
+
+For the boundary B to function as a **Markov blanket** (i.e., for B to mediate all interactions between A and Ä), the coupling HAÄ must be weak/sparse:
+
+dim(HAÄ) ≪ dim(HA), dim(HÄ)
+
+This is the condition of **state separability**: A and Ä have conditionally independent states.
+
+### 2.7 State separability as the key assumption
+
+A and Ä are **separable** if their joint state can be written as a product:
+
+|ψ⟩AÄ = |ψ⟩A ⊗ |ψ⟩Ä
+
+This is the condition for the boundary to function as a true Markov blanket. The boundary B "screens off" A from Ä: knowledge of B is sufficient to predict both A's actions on B and Ä's actions on B.
+
+Separability requires **weak or sparse coupling**: HAÄ must be much "smaller" than HA or HÄ in some appropriate sense (e.g., dimension, norm). Intuition: the evolutions of A and Ä are almost independent.
+
+### 2.8 Variational free energy
+
+In the FEP framework (Friston), **variational free energy (VFE)** is an upper bound on the surprise (negative log evidence) of sensory observations given a generative model. Minimizing VFE minimizes surprise.
+
+In Fields' framework: **VFE measures interaction strength**. Specifically, VFE is high when A and Ä are tightly coupled (HAÄ is large), and low when they are weakly coupled (HAÄ is small). Minimizing VFE is keeping HAÄ weak while allowing thermodynamic exchange.
+
+A and Ä maintain their identities as distinct systems only while the boundary B remains intact. If B is "ripped" (HAÄ becomes large), A and Ä merge into a single coupled system.
+
+### 2.9 Interesting behavior (the seven criteria)
+
+Fields gives seven criteria for "interesting behavior" — the kind that distinguishes living systems from inert systems, even under the most permissive generic-system framing:
+
+1. **Surprising** — unpredictable in practice.
+2. **Approximately predictable** — only predictable if coarse-grained.
+3. **Unpredictable in principle** — not even in principle determinable from outside.
+4. **Learns from experience** — past behavior influences future behavior.
+5. **Memory-dependent** — internal state affects response.
+6. **Context-dependent** — environmental state affects response.
+7. **Kolmogorov-violating** — joint probability distributions on observational outcomes are undefined in principle.
+
+**Claim:** all of these are generic properties of any system with a separable boundary. The framework predicts that all generic systems exhibit these properties — biology, AI, networks, etc.
+
+### 2.10 Moore's theorem (1956)
+
+Edward F. Moore proved in 1956: **finite input-output experiments cannot uniquely determine the machine table (internal state-transition probabilities) of a generic classical Black Box.**
+
+The example: a box with an internal clock. From the outside, you observe inputs and outputs. You cannot determine whether the box is following a particular sequence or using an internal clock — the external observations are consistent with both interpretations.
+
+**Implication:** there is no "universal experiment" that distinguishes all possible internal state-transition tables. Finite observations are always consistent with multiple internal implementations.
+
+### 2.11 Conway-Kochen free will theorem (2006, 2009)
+
+John Conway and Simon Kochen proved: **special relativity + quantum theory together rule out local (past light cone) determinism.** "If experimenters make choices, electrons do too."
+
+The theorem: if experimenters can freely choose measurement settings (within their past light cone), then particles can freely choose measurement outcomes (within their past light cone). Both choices are "free" in the sense of not being determined by the past light cone.
+
+**Implication:** at the most fundamental level, nature exhibits irreducible freedom. The universe is not a deterministic clock.
+
+### 2.12 Tipler singularity removal (2014)
+
+Frank Tipler argued: **the simplest formal removal of singularities from classical physics reproduces Bohm's "quantum potential."**
+
+The procedure: take classical Hamiltonian mechanics, identify the singularities (divergences, infinities), and add minimal constraints to remove them. The result is a theory that looks like Bohmian mechanics — a deterministic hidden-variable theory with a "quantum potential" that produces the standard quantum predictions.
+
+(N. Gisin comment: Newton-Laplace physics wasn't singular because it wasn't local. Einstein introduced strict locality, which led to the need for the singularity-removal procedure.)
+
+### 2.13 Geometric phase / Berry phase
+
+For a quantum system transported around a closed path in its state space, the system returns to its original state up to a **geometric phase factor** exp(iφ) where φ depends only on the path's geometry (not on the rate of transport).
+
+This is the **Berry phase** (Michael Berry, 1984). It is:
+- **Geometric**: depends on the path, not the dynamics.
+- **Holonomic**: non-trivial for non-contractible paths.
+- **Non-integrable**: cannot be removed by a gauge choice.
+
+In Fields' framework: **the geometric phase represents internal memory**. The internal state of a system (Ä) changes when transported along a path in state space, and the change is captured by the Berry phase.
+
+### 2.14 Holonomy as a resource
+
+**Non-trivial holonomy is a provably sufficient resource for universal quantum computation.**
+
+This was proven by Zanardi and Rasetti (1999) and Pachos and Zanardi (2001). The construction:
+
+|ψ⟩B ⊗ |ψ⟩Ä ↦ |ψ'⟩B ⊗ |ψ'⟩Ä
+
+for arbitrary |ψ⟩B → |ψ'⟩B. Holonomy in the internal state space Ä allows the system to implement any desired input-output map on the boundary B.
+
+**Implication:** if a system exhibits non-trivial holonomy (which all generic systems with separable boundaries do, per the framework), it can in principle implement universal computation. This is a general result, not specific to quantum computers.
+
+### 2.15 Polycomputation
+
+**Polycomputation is generic.** For any sufficiently complex system, multiple distinct computations can be embedded in its observable behavior. The mapping from behavior to abstract computation is many-to-one (embeddings are injective, projections are surjective).
+
+Examples:
+- A laptop is running many processes simultaneously; the "ready state" is a projection of the full state.
+- An organism is doing many things (digesting, sensing, moving, etc.); the "behavior" is a projection.
+
+Polycomputation is not a defect of analysis; it is a **structural property** of any system with state separability.
+
+### 2.16 The Moore-theorem update (Fields, 2026+)
+
+The classical picture of an ideal computer: input + ready state → some processing → output + ready state. The "ready state" is a coarse-grained summary.
+
+Fields' update: the observed "ready state" (a projection of the boundary B) does **not** pick out a unique machine state |ψ⟩Ä. The internal state has holonomy, so its representation depends on the path. Multiple distinct |ψ⟩Ä are consistent with the same observed B.
+
+**This is Moore's theorem, updated for generic systems.** Finite experiments can't determine internal state transitions — even in principle.
+
+### 2.17 Non-commuting QRFs (Quantum Reference Frames)
+
+The boundary B can be characterized by **quantum reference frames (QRFs)** — local coordinate systems used to describe measurements and actions.
+
+The implication: the QRFs (σz, σz1) and (σz, σz2) **do not commute**. The order in which they are measured affects the outcome.
+
+If Ä exhibits non-trivial holonomy, how it acts on B will change depending on the order of QRF measurements. This generates **non-causal context dependence**: the joint probability distribution on observational outcomes is undefined (violates Kolmogorov).
+
+(Reference: Fields & Glazebrook, Int. J. Theor. Phys. 62 (2023) 159.)
+
+### 2.18 Planarian bioelectric memory as holonomy
+
+Marcel Blattner (2026) applies the holonomy framework to planarian bioelectric memory. The bioelectric state space has a non-trivial geometric structure; pattern memory is stored as Berry phase in the bioelectric dynamics.
+
+This is the formal counterpart of Levin's empirical observations: planaria with perturbed bioelectric connectivity regenerate head shapes of other species. In Fields' framework, this is the bioelectric state space's **holonomy** being modified by perturbations.
+
+### 2.19 Persistent observability
+
+A system is **persistently observable** if its identity (boundary B) is maintained across interactions. Persistent observability requires:
+1. State separability (Markov blanket).
+2. Weak coupling (HAÄ ≪ HA, HÄ).
+3. Non-trivial holonomy (memory).
+4. Persistence of the boundary (no rips).
+
+**Theorem:** persistent observability is mathematically equivalent to intelligence (per James's definition). A persistently observable system has a fixed goal (continued existence) achievable with variable means (internal dynamics HA, HÄ).
+
+### 2.20 QT provides the foundation for Diverse Intelligence
+
+The closing claim: **quantum theory provides a precise, general, strongly empirically validated foundation for Diverse Intelligence.**
+
+QT gives us:
+- State separability (Markov blanket).
+- Holonomy (memory).
+- Variational free energy (interaction strength).
+- Non-commuting reference frames (context dependence).
+- The limits of predictability (Moore, Conway-Kochen, Tipler).
+
+This is not because we need to build quantum computers — it's because **the math is right**. QT is the right framework for any generic system, biological or otherwise. Intelligence and persistent observability go hand in hand.
+
+---
+
+## 3. Frame Analysis
+
+33 unique frames were extracted from the 58MB mp4 at threshold 0.05; OCR'd via winsdk in 1.9s. The talk is slide-heavy with conceptual diagrams and equations.
+
+### 3.1 Frame 1 — Title slide (frame_00001)
+
+**OCR text:**
+> How diverse is intelligence?
+> What are the limits?
+> How do we find out?
+> M. Levin, 10.1002/aisy.202401034
+
+The opening questions. Citation to Levin's 2024 paper in Advanced Intelligent Systems.
+
+### 3.2 Frame 2 — William James definition (frame_00002)
+
+**OCR text:**
+> "Intelligence is a fixed goal with variable means of achieving it."
+> — William James
+> Does any goal count?
+> Are any means allowed?
+> Does anything fall outside this definition?
+
+The working definition with the three questions it raises.
+
+### 3.3 Frame 3 — Mind Everywhere paper (frame_00003)
+
+**OCR text:**
+> Biological Theory
+> ORIGINAL ARTICLE
+> Mind Everywhere: A Framework for Conceptualizing Goal-Directedness in Biology and Other Domains—Part One
+> Michael Levin, David B. Resnik
+> Received: 31 March 2025 / Accepted: 22 November 2025
+> Abstract
+> What makes a system—evolved, engineered, or hybrid—describable by teleological and mentalistic terms such as intelligent, goal-directed, cognitive, and intentional? [...] This field seeks to characterize what all active agents, regardless of their composition or provenance, have in common.
+
+The Mind Everywhere paper abstract. The diverse intelligence field's foundational manifesto.
+
+### 3.4 Frame 4 — FEP path integrals paper (frame_00004)
+
+**OCR text:**
+> Physics of Life Reviews 47 (2023) 35-62
+> Path integrals, particular kinds, and strange things
+> Dalton A.R. Sakthivadivel, Karl Friston, Lancelot Da Costa, Conor Heins, Grigorios A. Pavliotis, Maxwell Ramstead, Thomas Parr
+> The free energy principle (FEP) describes a simple relationship between the dynamics of a random dynamical system and a description of its behaviour as engaging in inference. The FEP originated in neuroscience as an attempt to describe brain function and behaviour (Friston et al. 2006) and has since been extended to describe several kinds of things in the biological and physical realms (Friston 2013; Friston et al. 2021) through a special kind of mechanics—a Bayesian mechanics—that shares the same foundations with quantum, statistical, and classical mechanics.
+
+The FEP technical paper. Establishes FEP as the canonical framework for active inference.
+
+### 3.5 Frame 5 — Inert particles assumption (frame_00005)
+
+**OCR text:**
+> Inert particles with no active states
+> Active particles with active states
+> Conservative particles with classical dynamics
+> Strange particles with hidden active states
+> External states s
+> Sensory states s
+> Active states
+> Internal states
+> A causal sink violates Newton's 3rd Law
+> Fig. 2
+
+The problem with FEP's Fig. 2: it classifies particles as "inert" or "active," but inert particles violate Newton's third law. They are **causal sinks** — they receive action but don't exert action back.
+
+### 3.6 Frame 6 — Physics first (frame_00006)
+
+**OCR text:**
+> Physics first, intuitions later ...
+> How do we guarantee that this interaction respects all physical symmetries?
+> We want the generic case, that describes any interacting systems, regardless of scale or structure.
+
+The methodological commitment.
+
+### 3.7 Frame 7 — Start with the generic case (frame_00007)
+
+**OCR text:**
+> Answer: Start with the generic case
+> U, an isolated system (no environment, no interaction)
+> The internal dynamics PU must respect Newton's 3rd Law everywhere.
+> No sources, no sinks — because U has no environment.
+> PU conserves momentum, energy, information (so is unitary).
+
+The starting assumption. An isolated system with no environment.
+
+### 3.8 Frame 8 — Quantum theory (frame_00008)
+
+**OCR text:**
+> An isolated (no environment) U is a productive assumption.
+> This gives us conservation of information, so unitarity, so linearity.
+> Hence is a linear operator on the state space, a Hilbert space.
+> In background time t, we can write TU(t) = exp((-i/ℏ)HU·t), where ℏ is an action and HU is a Hamiltonian (energy) linear operator on YLJ.
+> A finite value of ℏ ⟺ no singularities.
+> This is quantum theory (QT). "Isolation is all you need."
+
+The derivation. From isolation → unitarity → linearity → Hilbert space → quantum theory. Finite ℏ is required to avoid singularities.
+
+### 3.9 Frame 9 — Linear decomposition (frame_00009)
+
+**OCR text:**
+> Because everything in sight is linear, we can do a linear decomposition.
+> Boundary "B
+> U = A Ä, HU = HA + HÄ + HAÄ. HAÄ is the interaction between A and Ä.
+> This is the generic, symmetry-preserving interaction we wanted.
+
+The decomposition. U = A ∪ Ä; HU = HA + HÄ + HAÄ. The interaction term HAÄ mediates the boundary B.
+
+### 3.10 Frame 10 — Holographic screen (frame_00010)
+
+**OCR text:**
+> Without loss of generality,
+> HAÄ = kBT kE·ℏ·σz(σz1, σz2, ..., σzN)
+> where k = A or Ä, σz is a z-spin operator, and σz_i is a local z reference frame.
+> This makes "B an N-qubit holographic screen.
+
+The interaction Hamiltonian as an N-qubit holographic screen. Each "spin" is a local reference frame.
+
+### 3.11 Frame 11 — State separability (frame_00011)
+
+**OCR text:**
+> HAÄ tells of how A and Ä act on each other.
+> We want it to tell us how they influence each other.
+> These are the same if but only if A and Ä have conditionally-independent states.
+> So we need to require that |ψ⟩AÄ = |ψ⟩A ⊗ |ψ⟩Ä. This is state separability = absence of entanglement.
+> Separability requires weak (or sparse) coupling. Formally, the dimension of HAÄ is small: dim(HAÄ) ≪ dim(HA), dim(HÄ).
+> Intuitively, the evolutions of A and Ä are almost independent.
+
+The condition for B to function as a Markov blanket. State separability requires weak/sparse coupling.
+
+### 3.12 Frame 12 — Minimal physics to FEP (frame_00012)
+
+**OCR text:**
+> Minimal physics ...........+ FEP
+> If A and Ä are separable, dim(HAÄ) ≪ dim(HA), dim(HÄ):
+> • HAÄ fully describes information exchange between A and Ä;
+> • The boundary "B functions as a Markov Blanket;
+> • Variational free energy (VFE) measures interaction strength;
+> • Minimizing VFE is keeping HAÄ weak while allowing thermodynamic exchange;
+> • Predictability = constrained interaction.
+> A and Ä maintain their identities as distinct systems only while their boundary "B remains intact — no rips, no explosions!
+
+The connection to FEP. With separability, the framework recovers the FEP. VFE measures interaction strength.
+
+### 3.13 Frame 13 — James's definition revisited (frame_00013)
+
+**OCR text:**
+> "Intelligence is a fixed goal with variable means of achieving it."
+> — William James
+> Does any goal count?
+> >> There's always at least one: continuing to exist as an entity.
+> Are any means allowed?
+> >> Whatever the internal dynamics HA and HÄ are capable of.
+> Does anything fall outside this definition?
+> >> No, it's completely generic.
+
+The answers. Yes (continued existence is always a goal). Yes (any internal dynamics). No (everything falls inside).
+
+### 3.14 Frame 14 — Is the behavior interesting? (frame_00014)
+
+**OCR text:**
+> We have a generic, symmetry-preserving description.
+> It is consistent with and even explains the FEP.
+> But is the behavior that counts as "intelligent" interesting?
+> Are there limits on what kinds of systems can exhibit interesting behavior?
+> How do we find out?
+
+The pivot. We have the formalism; is the resulting behavior actually interesting?
+
+### 3.15 Frame 15 — Interesting behavior criteria (frame_00015)
+
+**OCR text:**
+> What is interesting behavior?
+> • Surprising, unpredictable in practice
+> • Only approximately predictable (only predictable if coarse-grained)
+> • Unpredictable in principle
+> • Learns from experience
+> • Memory-dependent
+> • Context-dependent
+> • Distributions of outcome values violate Kolmogorov, outcome probabilities undefined in principle
+
+The seven criteria.
+
+### 3.16 Frame 16 — Operationally (frame_00016)
+
+**OCR text:**
+> Operationally,
+> State transition probabilities derived from finite observations do not converge to predictive adequacy.
+> Induction from finite data doesn't work.
+> 19th Century "mechanical" expectations are violated.
+> We know Life violates them. What else does?
+
+The operational meaning. Finite observations can't determine internal state transitions.
+
+### 3.17 Frame 17 — Moore's theorem (frame_00017)
+
+**OCR text:**
+> Hint: Moore's theorem (1956):
+> Finite input-output experiments cannot uniquely determine the "machine table" (internal state-transition probabilities) of a generic classical Black Box.
+> Example: Box with an internal clock, e.g. time bomb.
+
+The first impossibility theorem.
+
+### 3.18 Frame 18 — Conway-Kochen free will theorem (frame_00018)
+
+**OCR text:**
+> Hint: Conway-Kochen "free will" theorem (2006, 2009):
+> Special relativity and quantum theory together rule out local (past light cone) determinism.
+> "If experimenters make choices, electrons do too."
+
+The second impossibility theorem.
+
+### 3.19 Frame 19 — Tipler singularity removal (frame_00019)
+
+**OCR text:**
+> Hint: QT from singularity removal (Tipler, 2014):
+> The simplest formal removal of singularities from classical physics reproduces Bohm's "quantum potential."
+> (N. Gisin: Newton-Laplace physics wasn't singular because it wasn't local. Einstein introduced strict locality.)
+
+The third impossibility theorem.
+
+### 3.20 Frame 20 — Generic systems display interesting behavior (frame_00020)
+
+**OCR text:**
+> These all suggest:
+> Generic systems (can) display interesting behavior.
+> How do we make this precise?
+> How do we understand it?
+> How can we use it to explain and/or predict?
+
+The conclusion from the three impossibility theorems.
+
+### 3.21 Frame 21 — The setup (frame_00021)
+
+**OCR text:**
+> The setting:
+> A's measurements and action choices are computed by HA (In FEP, A's GM).
+> Observations
+> Boundary "B
+> and actions (1/0) live here, on "B.
+> dim(HAÄ) ≪ dim(HA), dim(HÄ)
+> Inputs and outputs are much less complex than the computations that generate them.
+
+The formal setup. A's computations are on B; inputs/outputs are simpler than computations.
+
+### 3.22 Frame 22 — Recurrence doesn't imply recurrence (frame_00022)
+
+**OCR text:**
+> This dimensionality/complexity difference immediately tells us:
+> Recurrence of |ψ⟩B does not imply recurrence of |ψ⟩Ä.
+> Behavior generically depends on "hidden" internal states, i.e. on Ä's memory or internal context.
+> We can represent this formally as an internal "geometric" or Berry phase.
+> Chris Fuchs: all physical systems have "interiority."
+
+The crucial implication. Boundary recurrence ≠ internal recurrence. Internal state has memory (Berry phase).
+
+### 3.23 Frame 23 — Geometric phase in planarians (frame_00023)
+
+**OCR text:**
+> Geometric phase changes are introduced by transports along curves in state spaces. These are "holonomy" operations.
+> E.g. Blattner (2026):
+> Hidden regenerative state in planarians:
+> A geometric model of bioelectric memory using Tangential Action Spaces
+> Marcel Blattner
+
+The application. Blattner's planarian bioelectric memory as holonomy in the bioelectric state space.
+
+### 3.24 Frame 24 — Holonomy as quantum computing resource (frame_00024)
+
+**OCR text:**
+> Why is this important?
+> Non-trivial geometric phase dependence — non-trivial holonomy — is a sufficient resource for universal quantum computation.
+> It constructs a map: |ψ⟩B ↦ |ψ'⟩B ⊗ |ψ'⟩Ä for arbitrary |ψ⟩B.
+> • Zanardi, P. and Rasetti, M. Holonomic quantum computation. Phys. Lett. A 264 (1999), 94-99.
+> • Pachos, J. and Zanardi, P. Quantum holonomies for quantum computing. Int. J. Mod. Phys. B 15 (2001), 1257-1286.
+
+The deep result. Holonomy = universal quantum computation (Zanardi-Rasetti 1999).
+
+### 3.25 Frame 25 — Physically implemented computation (frame_00025)
+
+**OCR text:**
+> What is physically implemented computation?
+> Input ----+ Output
+> Input ---+ Output
+> "P(t) implements f on Input if and only if these diagrams commute.
+> The "interpretation" is a projection/inverse embedding: = 8^-1.
+
+Definition. Implemented computation = commuting diagram between physical behavior and abstract computation.
+
+### 3.26 Frame 26 — Polycomputation (frame_00026)
+
+**OCR text:**
+> Why is this important?
+> Embeddings are injective: one to many.
+> Polycomputation is generic.
+> Indeed, managing thermodynamic flow requires that "informative" sector projections are proper samples of W. We never look at everything the computer is doing.
+
+Polycomputation is generic. Many computations in one behavior.
+
+### 3.27 Frame 27 — Classical computer as coarse-graining (frame_00027)
+
+**OCR text:**
+> We can think of computation as "scattering" in data-structure space.
+> An ideal classical computer implementing an algorithm for f looks like:
+> "Ready" state + Input → Output + "Ready" state
+> This is a useful coarse-graining, but the observed "Ready state" (a proper projection of B) does not pick out a unique machine state |ψ⟩Ä. This is Moore's Theorem from 1956, updated.
+
+Moore's theorem updated for generic systems. The "ready state" projection is ambiguous.
+
+### 3.28 Frame 28 — Even classical OS has internal state (frame_00028)
+
+**OCR text:**
+> Even a classical OS accumulates internal state changes as it executes.
+> "Side projects" are inevitable in generic systems.
+> "Ready" State
+> Input 1 → Output 1
+> Input 2 → Output 2
+> Input N → Output N
+> Final state
+
+Side projects. Generic systems always have "extras" beyond the main computation.
+
+### 3.29 Frame 29 — QRFs and holonomy (frame_00029)
+
+**OCR text:**
+> We can also represent geometric phase changes as reference frame changes:
+> (σz, ) ↔ (σz, )'
+> Holonomy
+> If Ä exhibits non-trivial holonomy, how it acts on 'B will change.
+
+Holonomy as QRF changes.
+
+### 3.30 Frame 30 — Non-commuting QRFs (frame_00030)
+
+**OCR text:**
+> Why is this important?
+> (σz, ) and (σz, )' don't commute!
+> Non-commuting QRFs generate non-causal context dependence.
+> In this case, joint probability distributions on observational outcomes are undefined (violate Kolmogorov).
+> Fields and Glazebrook, Int. J. Theor. Phys. 62 (2023) 159
+
+Non-commuting QRFs. The framework predicts Kolmogorov violations for generic systems.
+
+### 3.31 Frame 31 — All these are generic (frame_00031)
+
+**OCR text:**
+> All of these "interesting" kinds of behavior are generic!
+> • Surprising, unpredictable in practice
+> • Only approximately predictable (only predictable if coarse-grained)
+> • Unpredictable in principle
+> • Learns from experience
+> • Memory-dependent
+> • Context-dependent
+> • Distributions of outcome values violate Kolmogorov, outcome probabilities undefined in principle
+> They all result from separability: big systems with small boundaries.
+
+The conclusion. All seven criteria for interesting behavior follow from separability.
+
+### 3.32 Frame 32 — QT provides the foundation (frame_00032)
+
+**OCR text:**
+> QT provides a precise, general, strongly empirically validated foundation for Diverse Intelligence.
+> It tells us that intelligence and persistent observability go hand in hand.
+> M. Levin, 10.1002/aisy.202401034
+
+The closing claim. QT is the foundation for the diverse intelligence framework.
+
+### 3.33 Frame 33 — Thank you (frame_00033)
+
+**OCR text:**
+> Thank you
+> Questions?
+> Thanks to Jim Glazebrook.
+
+The closing slide. Acknowledgment to Jim Glazebrook (collaborator on Fields & Glazebrook 2023 paper).
+
+---
+
+## 4. Transcript Highlights
+
+Sixteen verbatim passages from the cleaned transcript (885 segments, 30KB) that capture the conceptual flow.
+
+### 4.1 Motivation (T+0:30)
+
+> "I want to talk today about interesting behavior by generic systems. [...] the context of the diverse intelligence project which raises these questions: how diverse is intelligence and what what are the limits of intelligence uh if there are limits and how do we find out."
+
+The framing. Diverse Intelligence project; limits of intelligence; how to find out.
+
+### 4.2 William James's definition (T+1:30)
+
+> "We can look at this definition of intelligence that we've been using in the lab from William James as as kind of a guideline that intelligence is a fixed goal achievable with variable means of achieving it. So intelligence involves some level of flexibility and this definition itself raises questions. Uh does any goal count? Uh are many any kinds of means allowed and does anything fall outside this definition?"
+
+The working definition and the three questions it raises.
+
+### 4.3 Mind Everywhere methodological guidelines (T+3:00)
+
+> "Some sort of methodological guidelines uh have appeared recently. Uh, for example, in this paper that Mike and David Resnik published last year, uh, emphasizing that the diverse intelligence project or the the TAM framework, emphasizes methodologically a reliance on empirical research, not on intuition for thinking about intelligence."
+
+The methodological commitment. Empirical over philosophical.
+
+### 4.4 The FEP inertness problem (T+4:30)
+
+> "When you look into this paper here's figure two already we find an assumption that there's some systems that are inert that don't act on the world at all. And that's a problem because a system that doesn't act back on the world when the world acts on it is violating Newton's third law. So it's it's violating a very basic physical symmetry principle."
+
+The critique of FEP. Inert particles violate Newton's third law.
+
+### 4.5 Physics first (T+5:30)
+
+> "So in that case I think we need to take an approach where we look at physics first and worry about intuitions later. So if we have a system which I'll call A and it's interacting with something else which I'll call A bar or the complement of A for reasons that will become clear. How do we guarantee that this interaction respects all of the physical symmetries that it needs to respect?"
+
+The methodological commitment. Derive from physics, not intuition.
+
+### 4.6 Start with the generic case (T+6:30)
+
+> "Let's assume the simplest thing we can assume which is a system that doesn't interact with anything. So a system that doesn't have an environment. Um so a system that's isolated. And if we start with that, um, we know that we're going to respect the various symmetries that have to do with not having singularities."
+
+The starting assumption. An isolated system.
+
+### 4.7 Quantum theory from isolation (T+8:00)
+
+> "If we have conservation of information in other words unitarity then we can represent the dynamics as a linear operator because nonlinearities don't conserve information. So this dynamics that I've called P of U the propagator of U is a linear operator on some state space. And in fact we can make the state space a Hilbert space."
+
+The derivation. Unitarity → linear operator → Hilbert space.
+
+### 4.8 "Isolation is all you need" (T+9:30)
+
+> "Now this theory is quantum theory of an isolated system. So in a sense isolation is all you need to get quantum theory. Uh it's a it's a good way to start because it gets you someplace that we understand and that we have empirical reasons to think is a good description of generic systems."
+
+The punchline. QT is the natural formalism for any isolated generic system.
+
+### 4.9 Boundary as Markov blanket (T+12:00)
+
+> "For the boundary to function as a Markov blanket (i.e., for B to mediate all interactions between A and Ä), the coupling HAÄ must be weak/sparse: dim(HAÄ) ≪ dim(HA), dim(HÄ). This is the condition of state separability: A and Ä have conditionally independent states."
+
+The boundary condition for state separability.
+
+### 4.10 VFE measures interaction (T+13:00)
+
+> "Variational free energy (VFE) measures interaction strength; Minimizing VFE is keeping HAÄ weak while allowing thermodynamic exchange; Predictability = constrained interaction."
+
+The connection to FEP.
+
+### 4.11 Interesting behavior criteria (T+17:00)
+
+> "What is interesting behavior? Surprising, unpredictable in practice. Only approximately predictable (only predictable if coarse-grained). Unpredictable in principle. Learns from experience. Memory-dependent. Context-dependent. Distributions of outcome values violate Kolmogorov, outcome probabilities undefined in principle."
+
+The seven criteria.
+
+### 4.12 Moore's theorem (T+18:30)
+
+> "Moore's theorem (1956): Finite input-output experiments cannot uniquely determine the 'machine table' (internal state-transition probabilities) of a generic classical Black Box. Example: Box with an internal clock, e.g. time bomb."
+
+The first impossibility theorem.
+
+### 4.13 Conway-Kochen free will (T+19:30)
+
+> "Conway-Kochen 'free will' theorem (2006, 2009): Special relativity and quantum theory together rule out local (past light cone) determinism. 'If experimenters make choices, electrons do too.'"
+
+The second impossibility theorem.
+
+### 4.14 Tipler singularity removal (T+20:00)
+
+> "QT from singularity removal (Tipler, 2014): The simplest formal removal of singularities from classical physics reproduces Bohm's 'quantum potential.'"
+
+The third impossibility theorem.
+
+### 4.15 Berry phase as memory (T+23:00)
+
+> "We can represent this formally as an internal 'geometric' or Berry phase. Chris Fuchs: all physical systems have 'interiority.'"
+
+The formal representation of internal memory.
+
+### 4.16 Holonomy as universal computation (T+24:30)
+
+> "Non-trivial holonomy is a provably sufficient resource for universal quantum computation. It constructs a map: |ψ⟩B ↦ |ψ'⟩B ⊗ |ψ'⟩Ä for arbitrary |ψ⟩B."
+
+The deep result. Holonomy = universal computation.
+
+### 4.17 Polycomputation (T+26:00)
+
+> "Embeddings are injective: one to many. Polycomputation is generic. Indeed, managing thermodynamic flow requires that 'informative' sector projections are proper samples of W. We never look at everything the computer is doing."
+
+Polycomputation as a structural property.
+
+### 4.18 Non-commuting QRFs (T+30:00)
+
+> "(σz, ) and (σz, )' don't commute! Non-commuting QRFs generate non-causal context dependence. In this case, joint probability distributions on observational outcomes are undefined (violate Kolmogorov)."
+
+The framework predicts Kolmogorov violations for generic systems.
+
+### 4.19 Closing claim (T+32:00)
+
+> "QT provides a precise, general, strongly empirically validated foundation for Diverse Intelligence. It tells us that intelligence and persistent observability go hand in hand."
+
+The closing. QT is the right framework for diverse intelligence.
+
+---
+
+## 5. Mathematical / Theoretical Content
+
+This section develops the formal content of the talk. The talk is heavily mathematical; this section expands each result.
+
+### 5.1 The derivation of quantum theory from isolation
+
+**Assumption:** U is an isolated system (no environment, no interaction).
+
+**Consequence 1:** No sources, no sinks. U's dynamics PU must conserve momentum, energy, information.
+
+**Consequence 2:** PU conserves information → PU is **unitary**.
+
+**Consequence 3:** PU unitary → PU is **linear** (nonlinearity breaks unitarity; specific result from information theory).
+
+**Consequence 4:** PU linear → the state space can be made a **Hilbert space** H_U (every possible value of every possible degree of freedom as a basis vector).
+
+**Consequence 5:** In background time t, the propagator is:
+
+TU(t) = exp((-i/ℏ)·HU·t)
+
+where ℏ is a finite action constant and HU is the Hamiltonian. Finite ℏ ⟺ no singularities (ℏ = 0 or ∞ both produce singular behavior).
+
+**Result:** This is quantum theory (QT) — Schrödinger-style unitary dynamics on a Hilbert space.
+
+### 5.2 The boundary as Markov blanket
+
+**Decomposition:** U = A ∪ Ä, where A is the system of interest and Ä is its complement (everything else in U).
+
+**Hamiltonian decomposition (linearity):** HU = HA + HÄ + HAÄ, where:
+- HA acts on A's internal degrees of freedom.
+- HÄ acts on Ä's internal degrees of freedom.
+- HAÄ is the interaction term.
+
+**Markov blanket condition:** B is a Markov blanket between A and Ä if the joint state factorizes:
+
+|ψ⟩AÄ = |ψ⟩A ⊗ |ψ⟩Ä
+
+This is the condition of **state separability**: knowledge of B is sufficient to predict both A and Ä's actions on B, and vice versa.
+
+**Weak coupling requirement:** State separability requires weak coupling:
+
+dim(HAÄ) ≪ dim(HA), dim(HÄ)
+
+The interaction is much "smaller" (in dimension, norm, or other measure) than the internal dynamics. Intuition: A and Ä's evolutions are almost independent.
+
+### 5.3 VFE as interaction strength
+
+In the FEP framework (Friston), variational free energy VFE(q) = ⟨log p(o,s)⟩_q + H[q] is an upper bound on -log p(o) (negative log evidence).
+
+In Fields' framework: VFE measures the strength of HAÄ. Specifically:
+
+VFE = ⟨H_AÄ⟩ - T·S[AÄ]
+
+where ⟨H_AÄ⟩ is the expected interaction energy and T·S[AÄ] is the thermodynamic entropy of the joint system (T = temperature).
+
+Minimizing VFE = keeping HAÄ weak (low interaction energy) while allowing thermodynamic exchange (high entropy). This is exactly the condition for state separability (Markov blanket).
+
+### 5.4 Geometric phase (Berry phase) as memory
+
+For a quantum system with state |ψ⟩ transported around a closed path γ in parameter space:
+
+|ψ⟩ → exp(iφ_γ)·|ψ⟩
+
+where φ_γ = ∮ A·dl is the Berry phase. The phase depends only on the **path geometry** (not on the rate of transport, the energy, or any dynamic property).
+
+**Properties:**
+- Geometric: depends on the geometry of γ.
+- Holonomic: non-trivial when γ encloses a non-zero area in a curved parameter space.
+- Gauge-invariant: cannot be removed by a change of gauge.
+
+**As memory:** The internal state |ψ⟩Ä changes by exp(iφ_γ) when transported around a path. This change is **history-dependent** — the system "remembers" the path it took. Berry phase is the formal representation of internal memory in a quantum system.
+
+### 5.5 Holonomy and universal quantum computation
+
+**Zanardi-Rasetti 1999, Pachos-Zanardi 2001:** Any system with non-trivial holonomy can implement universal quantum computation.
+
+**Construction:**
+- The boundary B has N basis states (one per QRF).
+- The internal state |ψ⟩Ä has holonomy (non-trivial geometric phase).
+- The combined system can implement any unitary U: |ψ⟩B ↦ |ψ'⟩B ⊗ |ψ'⟩Ä.
+
+**Proof sketch:** Holonomy in the internal state space provides a sufficient set of generators for SU(2) on the boundary. Universal quantum computation requires the ability to generate any SU(2) gate; holonomy provides this.
+
+**Implication:** Any generic system with non-trivial holonomy is in principle a universal quantum computer. This is a mathematical result, not a specific implementation.
+
+### 5.6 Moore's theorem (formal)
+
+**Theorem (Moore 1956):** Let B be a "black box" with input alphabet I, output alphabet O, and an unknown finite set of internal states S. For any n < |S|, there exist two distinct machines M₁, M₂ with state-transition functions T₁, T₂ such that for any sequence of n input-output pairs (i₁, o₁), ..., (iₙ, oₙ), both M₁ and M₂ produce the observed outputs from the observed inputs.
+
+**Proof sketch:** The internal state has more degrees of freedom than the n input-output pairs can constrain. There are multiple distinct state-transition functions consistent with any finite observation.
+
+**Implication:** No finite experiment can determine the internal state-transition probabilities of a generic black box. External observation is always consistent with multiple internal implementations.
+
+### 5.7 Conway-Kochen free will theorem (formal)
+
+**Theorem (Conway-Kochen 2006, 2009):** Assume (1) special relativity (no faster-than-light signaling) and (2) quantum theory (measurement outcomes are constrained by the wave function). Then: if experimenters can freely choose measurement settings (within their past light cone), then particles can freely choose measurement outcomes (within their past light cone).
+
+**Proof sketch:** Suppose particle outcomes are determined by information in their past light cone. By special relativity, the particle's past light cone is contained in the experimenter's past light cone (since the experimenter can choose settings after receiving no signal from the particle). Then the experimenter's choices would have to determine the particle's outcomes — contradicting the freedom of the experimenter's choice.
+
+**Implication:** Quantum events are not determined by the past light cone. Particles exhibit "free will" in the same sense as experimenters.
+
+### 5.8 Tipler singularity removal (formal)
+
+**Theorem (Tipler 2014):** Starting from classical Hamiltonian mechanics with point particles, the minimal formal procedure to remove all singularities (divergences, infinities, undefined terms) reproduces Bohmian mechanics — a deterministic hidden-variable theory with a "quantum potential" that produces the standard quantum predictions.
+
+**Procedure:**
+1. Start with classical Hamilton-Jacobi equations.
+2. Identify all singularities (R = 0 in gravitational; ∇ψ = 0 in wave functions).
+3. Add minimal constraints to remove singularities.
+4. The result is a non-local potential (the "quantum potential") that drives particles in addition to the classical potential.
+
+**Implication:** Quantum theory emerges naturally from classical mechanics with singularity removal. The non-locality of QM is a feature, not a bug.
+
+(N. Gisin's commentary: classical Newton-Laplace mechanics was non-local, not local. Einstein introduced strict locality, which forced the singularity-removal procedure to produce QM.)
+
+### 5.9 Polycomputation (formal)
+
+**Definition:** A system S exhibits **polycomputation** if multiple distinct computable functions f₁, f₂, ..., f_k can be embedded in S's observable behavior in a way that satisfies:
+
+∀i ∈ {1, ..., k}: behavior(S) projects to f_i(input) with non-negligible probability.
+
+**Theorem:** Any system with state separability (Markov blanket, weak coupling) exhibits polycomputation.
+
+**Proof sketch:** The boundary B is a low-dimensional projection of the full system. Multiple distinct internal states |ψ⟩Ä project to the same boundary state |ψ⟩B. For each distinct |ψ⟩Ä, there is a distinct input-output map f_i. Hence polycomputation.
+
+**Examples:**
+- A laptop running many processes simultaneously.
+- An organism doing many things simultaneously (digesting, sensing, moving).
+
+Polycomputation is not a defect; it is a **structural property** of generic systems.
+
+### 5.10 Non-commuting QRFs and Kolmogorov violation
+
+A **Quantum Reference Frame (QRF)** is a local coordinate system (σz, σz_i) used to describe measurements and actions.
+
+**Theorem (Fields-Glazebrook 2023):** If a system exhibits non-trivial holonomy, its QRFs (σz, σz_1) and (σz, σz_2) do not commute:
+
+[(σz, σz_1), (σz, σz_2)] ≠ 0
+
+**Implication:** The order in which two measurements are performed affects the joint probability distribution. Formally:
+
+P(a, b | M₁, M₂) ≠ P(a, b | M₂, M₁)
+
+for measurements M₁, M₂ in non-commuting QRFs.
+
+**Kolmogorov violation:** A probability distribution requires an underlying σ-algebra with consistent joint probabilities. Non-commuting QRFs mean no such σ-algebra exists for generic systems. The joint probability is undefined in principle.
+
+This is the **most radical prediction** of the framework: generic systems exhibit behavior that violates the Kolmogorov axioms of probability theory.
+
+### 5.11 Persistent observability = intelligence
+
+**Theorem:** A generic system with state separability is **persistently observable** if and only if it satisfies James's definition of intelligence.
+
+**Definition (persistent observability):** The boundary B is maintained across interactions (no rips). The system can be re-identified after any finite sequence of interactions.
+
+**Definition (intelligence per James):** "A fixed goal achievable with variable means of achieving it." The fixed goal is continued existence (always present per the answer to "Does any goal count?"). The variable means are the internal dynamics HA, HÄ.
+
+**Proof sketch:**
+- Forward direction: persistent observability requires the boundary to be maintained. Maintenance of the boundary requires the system to have a fixed goal (continued existence). The means of maintaining the boundary are variable (depend on perturbations). Hence intelligence.
+- Reverse direction: intelligence (fixed goal + variable means) requires the system to maintain its identity (boundary) through variable perturbations. Hence persistent observability.
+
+The theorem establishes the equivalence: **intelligence = persistent observability**.
+
+---
+
+## 6. Connections
+
+This section maps the talk's content to the broader 12-video research campaign.
+
+### 6.1 Backward (cluster B foundations)
+
+#### 6.1.1 `free_lunches_levin_20260621`
+
+The Levin talk presents biological evidence for the Diverse Intelligence framework. Fields' talk provides the **formal theoretical foundation** for that framework. The two talks are complementary:
+- **Levin:** bioelectric pattern memory in planaria, Xenobots, FAR (free gift from math).
+- **Fields:** quantum-theoretic foundation, Markov blankets, geometric phase, holonomy = universal computation.
+
+The Blattner 2026 paper (cited by Fields) formalizes Levin's bioelectric memory as **holonomy in the bioelectric state space** — a direct bridge between the two talks.
+
+**Connection depth:** Foundational. Fields and Levin are co-collaborators on the Diverse Intelligence Project.
+
+#### 6.1.2 `platonic_intelligence_kumar_20260621`
+
+The Kumar talk argues that SGD finds FER (Fractured Entangled Representations) and open-ended search finds UFR (Unified Factored Representations). Fields' framework predicts that **all generic systems exhibit interesting behavior** (including FER-like brittleness) due to state separability and holonomy.
+
+**Connection:** FER/UFR may correspond to specific configurations of geometric phase in the system's state space. A network with UFR has holonomy that factorizes nicely across semantic axes; FER has tangled holonomy. This is a speculative but testable connection.
+
+**Connection depth:** Speculative. Pass 2 could explore this.
+
+### 6.2 Forward (cluster C applications)
+
+#### 6.2.1 `brain_counterintuitive_20260621`
+
+The brain counterintuitive talk covers cases of normal cognition despite massive brain damage (e.g., hydrocephalus with normal IQ). Fields' framework explains these cases:
+- The boundary (Markov blanket) is maintained.
+- The persistent observability is preserved.
+- The internal geometric phase accommodates the damage.
+- The "intelligence" (per James) continues.
+
+**Connection depth:** Direct application. Brain counterintuition is empirical evidence for persistent observability.
+
+#### 6.2.2 `neural_dynamics_miller_20260621`
+
+The neural dynamics talk covers dynamical systems approaches to neural computation. Fields' framework is a quantum-dynamical-systems framework:
+- Neural activity is a quantum system with holonomy.
+- Memory is Berry phase.
+- Learning is geometric phase change.
+- Polycomputation is the structural property.
+
+**Connection depth:** Mathematical. Neural dynamics is a specific implementation of Fields' generic-system framework.
+
+#### 6.2.3 `multiscale_hoffman_20260621`
+
+The multiscale Hoffman talk likely covers multi-scale phenomena. Fields' framework is explicitly multi-scale:
+- The decomposition U = A ∪ Ä applies at any scale.
+- The Markov blanket can be defined at any scale.
+- Holonomy can be defined at any scale.
+- Persistent observability can be defined at any scale.
+
+**Connection depth:** Mathematical. Multiscale is built into Fields' framework.
+
+### 6.3 Lateral (other cluster B / E videos)
+
+#### 6.3.1 `score_dynamics_giorgini_20260621`
+
+The Giorgini talk presents score-based generative modeling. The score function is the gradient of the log-density. In Fields' framework:
+- A "generic system" can be viewed as a sample from an unknown distribution.
+- The score function is the gradient of the log of that distribution.
+- DSM (Denoising Score Matching) is a procedure to estimate the score from samples.
+
+**Connection:** Giorgini's framework applies to any generic system with sufficient samples. The "stationary density" is the system's long-run distribution. The score function is the gradient of the log-density in the system's state space.
+
+**Connection depth:** Speculative. Pass 2 could explore whether DSM can estimate the geometric phase structure of generic systems.
+
+#### 6.3.2 `cs229_building_llms_20260621`
+
+The CS229 lecture on building LLMs covers the SGD paradigm. In Fields' framework, an LLM is a generic system with state separability. The LLM:
+- Has a boundary (input-output interface).
+- Has internal state (the weights and activations).
+- Exhibits interesting behavior (learning, memory, context-dependence).
+- Exhibits Kolmogorov-violating distributions (perplexity over sequences).
+
+**Connection depth:** Applied. LLMs are specific implementations of Fields' generic systems.
+
+#### 6.3.3 `entropy_epiplexity_20260621`
+
+The epiplexity talk covers Kolmogorov complexity and observer-relative information. Fields' framework relates to Kolmogorov complexity:
+- The internal state of a generic system is its "complexity."
+- The boundary's "explanation" of the internal state is the "epiplexity" (how much of the complexity is observer-relative).
+- Kolmogorov-violating distributions are those whose complexity exceeds any observer's capacity.
+
+**Connection depth:** Mathematical. Epiplexity is the observer-relative complexity of a generic system.
+
+### 6.4 Cross-cutting themes
+
+Four themes recur across the campaign and connect to Fields' talk:
+
+1. **Generic systems as the foundational concept** (this talk + score_dynamics + entropy_epiplexity + free_lunches).
+2. **Information geometry and geometric phase** (this talk + score_dynamics + free_lunches).
+3. **Persistent observability as the basis of identity** (this talk + free_lunches + brain_counterintuitive).
+4. **Limits of predictability** (this talk + score_dynamics + cs229 + cs336).
+
+---
+
+## 7. Open Questions
+
+Sixteen questions arising from this talk that Pass 2 (de-obfuscation via user's mathematical encoding) should address.
+
+### 7.1 Theoretical
+
+1. **The Platonic Space in Fields' framework.** Where does the Platonic Space (Kumar, Levin) fit in Fields' quantum formalism? Is the geometric phase structure a specific implementation of the Platonic Space?
+
+2. **The relationship between Moore's theorem and Kolmogorov violation.** Moore's theorem says finite observations can't determine internal state. Non-commuting QRFs say joint probabilities are undefined. Are these two manifestations of the same underlying principle?
+
+3. **The role of quantum reference frames.** QRFs are the coordinate systems used to describe measurements. If QRFs don't commute, what is the "natural" coordinate system for a generic system? Is there a preferred QRF?
+
+4. **The connection to Tipler's singularity removal.** Tipler says removing singularities from classical mechanics reproduces QM. Is the converse true: QM is the *unique* way to remove singularities? Or are there other consistent theories?
+
+5. **The nature of "interiority."** Chris Fuchs: "all physical systems have interiority." What does this mean operationally? Is interiority the same as memory (Berry phase), or is it a deeper concept?
+
+### 7.2 Empirical
+
+6. **Moore's theorem in biological systems.** Moore's theorem says finite experiments can't determine internal state. Has this been experimentally verified in biological systems? Planaria? Xenobots?
+
+7. **Conway-Kochen free will in molecular networks.** Per Fields' framework, even 4-node molecular networks (per Levin's FAR result) exhibit "free will" in the Conway-Kochen sense. Is this testable?
+
+8. **Kolmogorov violations in generic systems.** The framework predicts Kolmogorov violations for any sufficiently complex generic system. Are there empirical demonstrations?
+
+9. **Planarian bioelectric memory as holonomy.** Blattner 2026 formalizes bioelectric memory as Berry phase. Can this be tested experimentally? Predictions?
+
+10. **Polycomputation in LLMs.** Are LLMs polycomputers in the technical sense? Multiple computable functions embedded in their behavior?
+
+### 7.3 Applied
+
+11. **Quantum-inspired AI.** QT is the foundation for diverse intelligence. Are there specific algorithmic insights from QT that could improve AI (e.g., holonomy-based computation)?
+
+12. **Brain-machine interfaces.** The framework's multi-scale formalization could inform BMI design: the boundary between brain and machine can be made explicit.
+
+13. **Bioelectric medicine.** The framework predicts that bioelectric perturbations (per Levin) modify the geometric phase structure. Can this be used for therapy?
+
+14. **Predictability of generic systems.** The framework predicts limits on predictability. Are these limits the same as the limits observed in practice (e.g., financial markets, weather, ecology)?
+
+### 7.4 Philosophical
+
+15. **Is intelligence "real" or "observer-relative"?** Fields' framework treats intelligence as a structural property of any generic system. This is a strong claim. Is intelligence reduced to physics, or is there an irreducible aspect?
+
+16. **The "free will" question.** Conway-Kochen shows particles have "free will" in the sense that their outcomes are not determined by the past light cone. Does this constitute free will in the morally significant sense? Is human free will different from particle free will?
+
+---
+
+## 8. References
+
+People, papers, and concepts referenced in the talk and developed in the report.
+
+### 8.1 People
+
+| Person | Role |
+|---|---|
+| Chris Fields | Speaker; independent researcher, Allen Discovery Center collaborator |
+| Michael Levin | Diverse Intelligence collaborator |
+| David B. Resnik | Diverse Intelligence collaborator |
+| William James | Definition of intelligence (fixed goal, variable means) |
+| Karl Friston | Free Energy Principle |
+| Dalton A.R. Sakthivadivel | FEP technical paper co-author |
+| Lancelot Da Costa | FEP technical paper co-author |
+| Conor Heins | FEP technical paper co-author |
+| Grigorios A. Pavliotis | FEP technical paper co-author |
+| Maxwell Ramstead | FEP technical paper co-author |
+| Thomas Parr | FEP technical paper co-author |
+| Marcel Blattner | Planarian bioelectric memory model (2026) |
+| Edward F. Moore | Moore's theorem (1956) |
+| John Conway | Conway-Kochen free will theorem |
+| Simon Kochen | Conway-Kochen free will theorem |
+| Frank Tipler | Singularity removal (2014) |
+| Michael Berry | Berry phase |
+| Paolo Zanardi | Holonomic quantum computation (1999) |
+| Jiannis Pachos | Holonomic quantum computation (2001) |
+| Chris Fuchs | Cubist interpretation, "all physical systems have interiority" |
+| Jim Glazebrook | Fields-Glazebrook 2023 collaborator |
+
+### 8.2 Papers cited in the talk
+
+- **Levin & Resnik (2025).** Mind Everywhere: A Framework for Conceptualizing Goal-Directedness in Biology and Other Domains—Part One. *Biological Theory.*
+- **Sakthivadivel et al. (2023).** Path integrals, particular kinds, and strange things. *Physics of Life Reviews* 47, 35-62.
+- **Friston et al. (2006).** A free energy principle for the brain.
+- **Friston (2013).** Life as we know it.
+- **Friston et al. (2021).** A variational principle for generative models.
+- **Levin (2024).** Diverse Intelligence. *Advanced Intelligent Systems.*
+- **Zanardi & Rasetti (1999).** Holonomic quantum computation. *Phys. Lett. A* 264, 94-99.
+- **Pachos & Zanardi (2001).** Quantum holonomies for quantum computing. *Int. J. Mod. Phys. B* 15, 1257-1286.
+- **Fields & Glazebrook (2023).** Information-theoretic aspects of QRFs and holonomy. *Int. J. Theor. Phys.* 62, 159.
+- **Blattner (2026).** Hidden regenerative state in planarians: A geometric model of bioelectric memory using Tangential Action Spaces. (Reference.)
+- **Moore (1956).** Gedanken-experiments on sequential machines.
+- **Conway & Kochen (2006, 2009).** The free will theorem.
+- **Tipler (2014).** Quantum nonlocality from classical physics? (Reference.)
+
+### 8.3 Background concepts and references
+
+- **Berry (1984).** Quantal phase factors accompanying adiabatic changes. *Proc. R. Soc. London A* 392, 45-57.
+- **Bohm (1952).** A suggested interpretation of the quantum theory in terms of "hidden" variables.
+- **Gisin (various).** Non-locality in classical physics.
+- **Jaynes (1957).** Information theory and statistical mechanics.
+- **Friston (2010).** The free-energy principle: a unified brain theory?
+- **Pearl (2009).** Causality. (Markov blanket formalism.)
+- **Friston, Da Costa, et al. (2023).** Path integrals, particular kinds, and strange things.
+
+### 8.4 Internal cross-references
+
+- **umbrella spec.md** — `conductor/tracks/video_analysis_campaign_20260621/spec.md` — the FR6 8-section report structure.
+- **umbrella README.md** — `conductor/tracks/video_analysis_campaign_20260621/README.md` — research-pass framing.
+- **child #6 free_lunches_levin** — `conductor/tracks/video_analysis_free_lunches_levin_20260621/report.md` — most direct backward reference; Levin's biological evidence + Fields' formal theory.
+- **child #5 platonic_intelligence_kumar** — `conductor/tracks/video_analysis_platonic_intelligence_kumar_20260621/report.md` — adjacent cluster B; FER/UFR connection.
+- **child #4 score_dynamics_giorgini** — `conductor/tracks/video_analysis_score_dynamics_giorgini_20260621/report.md` — score function as a generic system primitive.
+- **child #3 entropy_epiplexity** — `conductor/tracks/video_analysis_entropy_epiplexity_20260621/report.md` — algorithmic information perspective.
+- **child #1 cs229_building_llms** — `conductor/tracks/video_analysis_cs229_building_llms_20260621/report.md` — LLMs as generic systems.
+- **child #2 probability_logic** — `conductor/tracks/video_analysis_probability_logic_20260621/report.md` — probability foundations.
+- **child #8-10 C-cluster** (planned) — brain_counterintuitive, neural_dynamics_miller, multiscale_hoffman.
+- **child #11-12 cs336, creikey** (planned) — LLMs/CV as generic systems with FER.
+
+---
+
+## Appendix A — Concept Map
+
+Twenty concepts organized by dependency layer.
+
+**Layer 0 (philosophical premises):**
+- The Diverse Intelligence Project
+- William James's definition of intelligence
+- Physics first, intuitions later
+
+**Layer 1 (the formalism):**
+- Generic systems
+- Quantum theory from isolation (unitarity, linearity, Hilbert space)
+- The boundary as Markov blanket
+- State separability (weak coupling)
+- Variational free energy (VFE)
+
+**Layer 2 (interesting behavior):**
+- The seven criteria (surprising, memory-dependent, etc.)
+- Persistent observability
+- Polycomputation
+- Polycomputation as generic
+
+**Layer 3 (impossibility theorems):**
+- Moore's theorem (1956) — finite experiments can't determine internal state
+- Conway-Kochen free will (2006, 2009) — no local determinism
+- Tipler singularity removal (2014) — QM from singularity removal
+- Non-commuting QRFs (Fields-Glazebrook 2023) — Kolmogorov violation
+
+**Layer 4 (memory and computation):**
+- Geometric phase (Berry phase) as memory
+- Holonomy
+- Holonomy = universal quantum computation (Zanardi-Rasetti)
+- Blattner's planarian bioelectric memory model
+
+**Layer 5 (the synthesis):**
+- Persistent observability = intelligence (theorem)
+- QT provides the foundation for Diverse Intelligence
+- Limits of predictability are intrinsic to generic systems
+
+---
+
+## Appendix B — Transcript Excerpts (verbatim, by section)
+
+### B.1 Motivation
+
+> "I want to talk today about interesting behavior by generic systems. [...] the diverse intelligence project which raises these questions: how diverse is intelligence and what what are the limits of intelligence uh if there are limits and how do we find out."
+
+### B.2 William James
+
+> "Intelligence is a fixed goal with variable means of achieving it. So intelligence involves some level of flexibility and this definition itself raises questions. Uh does any goal count? Uh are many any kinds of means allowed and does anything fall outside this definition?"
+
+### B.3 Inertness problem
+
+> "When you look into this paper here's figure two already we find an assumption that there's some systems that are inert that don't act on the world at all. And that's a problem because a system that doesn't act back on the world when the world acts on it is violating Newton's third law."
+
+### B.4 Start with isolation
+
+> "Let's assume the simplest thing we can assume which is a system that doesn't interact with anything. So a system that doesn't have an environment. Um so a system that's isolated. And if we start with that, um, we know that we're going to respect the various symmetries that have to do with not having singularities."
+
+### B.5 Isolation = QT
+
+> "Now this theory is quantum theory of an isolated system. So in a sense isolation is all you need to get quantum theory."
+
+### B.6 Markov blanket
+
+> "For the boundary to function as a Markov blanket (i.e., for B to mediate all interactions between A and Ä), the coupling HAÄ must be weak/sparse: dim(HAÄ) ≪ dim(HA), dim(HÄ). This is the condition of state separability: A and Ä have conditionally independent states."
+
+### B.7 VFE
+
+> "Variational free energy (VFE) measures interaction strength; Minimizing VFE is keeping HAÄ weak while allowing thermodynamic exchange; Predictability = constrained interaction."
+
+### B.8 Seven criteria
+
+> "What is interesting behavior? Surprising, unpredictable in practice. Only approximately predictable (only predictable if coarse-grained). Unpredictable in principle. Learns from experience. Memory-dependent. Context-dependent. Distributions of outcome values violate Kolmogorov, outcome probabilities undefined in principle."
+
+### B.9 Moore's theorem
+
+> "Moore's theorem (1956): Finite input-output experiments cannot uniquely determine the 'machine table' (internal state-transition probabilities) of a generic classical Black Box. Example: Box with an internal clock, e.g. time bomb."
+
+### B.10 Conway-Kochen
+
+> "Conway-Kochen 'free will' theorem (2006, 2009): Special relativity and quantum theory together rule out local (past light cone) determinism. 'If experimenters make choices, electrons do too.'"
+
+### B.11 Tipler
+
+> "QT from singularity removal (Tipler, 2014): The simplest formal removal of singularities from classical physics reproduces Bohm's 'quantum potential.'"
+
+### B.12 Berry phase
+
+> "We can represent this formally as an internal 'geometric' or Berry phase. Chris Fuchs: all physical systems have 'interiority.'"
+
+### B.13 Holonomy = UQC
+
+> "Non-trivial holonomy is a provably sufficient resource for universal quantum computation."
+
+### B.14 Polycomputation
+
+> "Embeddings are injective: one to many. Polycomputation is generic. Indeed, managing thermodynamic flow requires that 'informative' sector projections are proper samples of W. We never look at everything the computer is doing."
+
+### B.15 QRFs
+
+> "(σz, ) and (σz, )' don't commute! Non-commuting QRFs generate non-causal context dependence. In this case, joint probability distributions on observational outcomes are undefined (violate Kolmogorov)."
+
+### B.16 Closing
+
+> "QT provides a precise, general, strongly empirically validated foundation for Diverse Intelligence. It tells us that intelligence and persistent observability go hand in hand."
+
+---
+
+## Appendix C — Formalizations (expanded)
+
+### C.1 QT from isolation (full derivation)
+
+**Assumption:** U is an isolated system.
+
+**Step 1:** Newton's third law. U's dynamics PU has no sources, no sinks (no environment to receive action from or send action to). Momentum is conserved within U.
+
+**Step 2:** Conservation of energy. PU conserves energy within U.
+
+**Step 3:** Conservation of information. PU conserves information content within U. Formally: the dynamics is reversible.
+
+**Step 4:** Unitary. PU is unitary — it preserves inner products. Formally: ⟨PU(x) | PU(y)⟩ = ⟨x | y⟩ for all x, y.
+
+**Step 5:** Linear. Unitarity implies linearity (a specific theorem from information theory; nonlinear transformations generally don't preserve information).
+
+**Step 6:** Hilbert space. The state space can be made a Hilbert space H_U. Each basis vector corresponds to a possible value of a degree of freedom.
+
+**Step 7:** Hamiltonian dynamics. In background time t, the propagator is:
+
+TU(t) = exp((-i/ℏ)·HU·t)
+
+where ℏ is a finite action constant and HU is the Hamiltonian operator (energy). This is the Schrödinger form.
+
+**Step 8:** Finite ℏ ⟺ no singularities. ℏ = 0 produces a singular dynamics (PU = identity, no evolution). ℏ = ∞ produces a singular dynamics (PU = 0, infinite energy). Finite ℏ is required for a non-singular dynamics.
+
+**Result:** This is quantum theory.
+
+### C.2 State separability and Markov blanket (full derivation)
+
+**Setup:** U = A ∪ Ä, with boundary B. H_U = H_A ⊗ H_Ä + interaction term.
+
+**Condition:** The boundary B functions as a Markov blanket if:
+
+p(state_A, state_Ä | B) = p(state_A | B) · p(state_Ä | B)
+
+i.e., A and Ä are conditionally independent given B.
+
+**Weak coupling requirement:** For state separability to hold, the interaction Hamiltonian HAÄ must be "small" relative to HA and HÄ:
+
+dim(H_AÄ) ≪ dim(H_A), dim(H_Ä)
+
+(where dim(H) is the dimension of the operator space).
+
+**Why weak coupling:** If HAÄ is large (A and Ä are strongly coupled), then the joint state of A and Ä cannot be factorized — A's state is entangled with Ä's. The boundary cannot function as a clean separator.
+
+**Result:** Markov blanket ↔ state separability ↔ weak coupling.
+
+### C.3 VFE = interaction strength (full derivation)
+
+The FEP definition of VFE:
+
+F = ⟨log p(o, s)⟩_q + H[q]
+
+where q is a variational distribution over hidden states, o is observations, s is hidden states, and H[q] is the entropy of q.
+
+In Fields' framework:
+
+F = ⟨H_AÄ⟩ - T · S[AÄ]
+
+where ⟨H_AÄ⟩ is the expected interaction energy, T is temperature, and S[AÄ] is the thermodynamic entropy of the joint system.
+
+**Interpretation:** F is high when:
+- Interaction energy is high (strong coupling, "non-separability").
+- Entropy is low (the system is "locked" into a small set of states).
+
+Minimizing F means: weak coupling (low H_AÄ) + high entropy (the system explores many states). This is exactly the state-separability condition.
+
+### C.4 Berry phase (full derivation)
+
+For a quantum system with Hamiltonian H(λ(t)) depending on a parameter λ(t):
+
+|ψ(t)⟩ = U(t) |ψ(0)⟩
+
+where U(t) is the time evolution operator.
+
+For slow (adiabatic) evolution around a closed loop γ in parameter space, the state returns to its original form up to a phase:
+
+|ψ(T)⟩ = exp(iφ_total) |ψ(0)⟩
+
+where φ_total = φ_dynamic + φ_geo. The dynamic phase φ_dynamic depends on the energy eigenvalues. The geometric phase φ_geo (Berry phase) depends only on the path γ:
+
+φ_geo = i ∮ ⟨ψ(λ) | ∇_λ | ψ(λ)⟩ · dλ
+
+**Properties:**
+- Geometric: depends on the geometry of γ.
+- Holonomic: non-trivial when γ encloses a non-contractible region in parameter space.
+- Gauge-invariant: invariant under local gauge choices.
+
+### C.5 Holonomy = UQC (full proof sketch)
+
+**Theorem (Zanardi-Rasetti 1999):** A system with non-trivial holonomy in its internal state space can implement universal quantum computation.
+
+**Proof sketch:**
+1. The boundary B has N basis states. Any computation on B is a unitary U: H_B → H_B.
+2. The internal state |ψ⟩Ä has holonomy in its parameter space.
+3. Holonomy is a non-Abelian gauge transformation on the internal states. The holonomy group can be SU(2) for sufficiently non-trivial geometry.
+4. SU(2) gates (with single-qubit rotations and CNOT-like entangling gates) are universal for quantum computation.
+5. Therefore, holonomy + boundary = universal computation.
+
+**Implication:** Any generic system with non-trivial holonomy is in principle a universal quantum computer.
+
+### C.6 Moore's theorem (full proof)
+
+**Theorem (Moore 1956):** Let B be a black box with input alphabet I (size |I|) and output alphabet O (size |O|). Suppose B has internal state space S with |S| ≥ 2. For any n < |S|, there exist two distinct internal state-transition tables T₁, T₂ that produce identical input-output behavior on all sequences of n input-output pairs.
+
+**Proof:**
+1. The number of distinct observable input-output behaviors of length n is |I|^n · |O|^n.
+2. The number of possible state-transition tables is |S|^|S| · |I|^|S| · |O|^|S|.
+3. For any fixed n, the number of distinct T's consistent with a given behavior is:
+   N(T | behavior) = (|S|^|S| · |I|^|S| · |O|^|S|) / (|I|^n · |O|^n) = |S|^|S| · |I|^(|S|-n) · |O|^(|S|-n)
+4. For n < |S|, N(T | behavior) > 1.
+5. Hence multiple distinct T's are consistent with any finite behavior.
+
+**Implication:** No finite experiment can distinguish all possible internal state-transition tables. Black-box behavior is under-determined by finite observation.
+
+### C.7 Conway-Kochen free will theorem (full proof)
+
+**Theorem (Conway-Kochen 2006):** Assume special relativity (no superluminal signaling) and quantum theory. If experimenters can freely choose measurement settings (within their past light cone), then particles can freely choose measurement outcomes (within their past light cone).
+
+**Proof sketch:**
+1. Suppose the experimenter at spacetime point E can freely choose measurement setting σ (a unit vector on the Bloch sphere).
+2. Suppose particle P at spacetime point P has spin measured along σ. Quantum theory gives P(↑ | σ) = cos²(θ/2) where θ is the angle between σ and some "preferred" direction.
+3. If particle outcomes are determined by information in P's past light cone, then P's past light cone must contain the determining information.
+4. By special relativity, P's past light cone is contained in E's past light cone (since E can choose σ after receiving no signal from P — i.e., after the past light cones have separated).
+5. Then E's choice of σ determines P's outcome, contradicting the freedom of E's choice.
+
+The contradiction shows that **particle outcomes are not determined by information in the past light cone**. Particles have "free will" in the sense that their outcomes are not constrained by any prior information.
+
+### C.8 Tipler singularity removal (full procedure)
+
+**Theorem (Tipler 2014):** Starting from classical Hamiltonian mechanics with point particles, the minimal procedure to remove all singularities reproduces Bohmian mechanics.
+
+**Procedure:**
+1. Start with classical Hamilton-Jacobi equations: ∂S/∂t + H(x, ∇S) = 0, where S is Hamilton's principal function and H is the classical Hamiltonian.
+2. Identify singularities: ∇S = 0 (stationary points of S), or other divergences.
+3. Add minimal constraints to remove singularities: e.g., require ∇S to be non-zero everywhere, with the singularity removed by re-deriving the equations.
+4. The result: a non-local potential Q (the "quantum potential") that drives particles in addition to the classical potential V:
+
+   ∂S/∂t + (1/2m)(∇S)² + V + Q = 0
+
+5. The quantum potential Q depends on the amplitude R (where ψ = R·exp(iS/ℏ)):
+
+   Q = -(ℏ²/2m)(∇²R / R)
+
+6. This is precisely Bohmian mechanics — particles have definite trajectories determined by the wave function.
+
+**Implication:** Quantum theory emerges naturally from classical mechanics with singularity removal. Non-locality is a feature.
+
+### C.9 Polycomputation (full proof)
+
+**Theorem:** Any generic system with state separability exhibits polycomputation.
+
+**Proof:**
+1. Generic system S has state |ψ⟩ = |ψ⟩A ⊗ |ψ⟩Ä (separable).
+2. The boundary B is a low-dimensional projection π(|ψ⟩) ∈ H_B.
+3. Multiple distinct internal states |ψ⟩Ä project to the same boundary state |ψ⟩B:
+
+   |ψ₁⟩Ä ↦ |ψ_B⟩, |ψ₂⟩Ä ↦ |ψ_B⟩, ..., |ψ_k⟩Ä ↦ |ψ_B⟩
+
+4. For each |ψᵢ⟩Ä, define f_i(input) = the system's behavior on `input` given that internal state.
+5. The boundary B doesn't distinguish |ψᵢ⟩Ä, so the system's observable behavior is consistent with multiple f_i.
+6. Hence polycomputation: multiple distinct computable functions are embedded in the same observable behavior.
+
+**Examples:**
+- A laptop: many processes, one observable behavior.
+- An organism: many simultaneous functions, one observable behavior.
+- An LLM: many "internal models" (or none), one observable next-token distribution.
+
+### C.10 Non-commuting QRFs (Fields-Glazebrook 2023)
+
+**Theorem:** If a system exhibits non-trivial holonomy, its QRFs do not commute:
+
+[(σz, σz_1), (σz, σz_2)] ≠ 0
+
+**Proof sketch:**
+1. QRF (σz, σz_1) is the local z-axis at position 1 on the boundary.
+2. QRF (σz, σz_2) is the local z-axis at position 2 on the boundary.
+3. For a system with non-trivial holonomy, transporting one QRF around the other changes its orientation (Berry phase).
+4. The non-commutativity follows from the geometric phase.
+
+**Kolmogorov violation:**
+1. A probability distribution requires a σ-algebra with consistent joint probabilities.
+2. For non-commuting measurements M₁, M₂:
+
+   P(a, b | M₁, M₂) ≠ P(a, b | M₂, M₁)
+
+3. The order of measurement affects the joint probability.
+4. No consistent σ-algebra exists. The Kolmogorov axioms are violated.
+
+**Implication:** Generic systems exhibit behavior that violates the standard axioms of probability theory. This is the **most radical prediction** of the framework.
+
+### C.11 Persistent observability = intelligence (full theorem)
+
+**Theorem:** A generic system with state separability is persistently observable if and only if it satisfies James's definition of intelligence.
+
+**Definitions:**
+- **Persistent observability:** The boundary B is maintained across interactions. After any finite sequence of interactions, the system can be re-identified.
+- **Intelligence (James):** "A fixed goal achievable with variable means of achieving it."
+
+**Forward direction (persistent observability ⟹ intelligence):**
+1. Persistent observability requires the boundary to be maintained across perturbations.
+2. The "goal" of maintaining the boundary is the fixed goal.
+3. The means of maintaining the boundary are variable (depend on the perturbations).
+4. Hence: fixed goal (boundary maintenance) + variable means (different responses to perturbations) ⟹ intelligence.
+
+**Reverse direction (intelligence ⟹ persistent observability):**
+1. Intelligence requires a fixed goal + variable means.
+2. The fixed goal is the system's identity (what makes it the same system across perturbations).
+3. The variable means are the system's responses to perturbations.
+4. The system's identity = its boundary.
+5. Hence: fixed goal + variable means ⟹ boundary maintenance ⟹ persistent observability.
+
+**Conclusion:** persistent observability ⟺ intelligence. The equivalence is exact.
+
+---
+
+## Appendix D — Connections (expanded)
+
+### D.1 To `free_lunches_levin_20260621` (in detail)
+
+Levin and Fields are co-collaborators on the Diverse Intelligence Project. Levin's talk provides biological evidence; Fields' talk provides the formal theoretical foundation.
+
+**Specific bridges:**
+- **Planarian bioelectric memory:** Levin demonstrates empirically; Blattner 2026 (cited by Fields) formalizes as holonomy.
+- **Xenobots:** Levin's biological substrate; Fields' framework predicts the behaviors are generic-system behaviors (interesting behavior criteria).
+- **Functional Agency Ratchet:** Levin's empirical claim (random networks exhibit FAR); Fields' framework predicts generic systems have non-trivial internal dynamics.
+
+### D.2 To `platonic_intelligence_kumar_20260621` (in detail)
+
+Kumar argues SGD finds FER (Fractured Entangled Representations). Fields' framework predicts that **all generic systems have non-trivial internal dynamics** (per the seven criteria).
+
+**Connection:** A network with FER has tangled internal dynamics; a network with UFR has well-structured internal dynamics. Both are generic systems. The difference is in the geometry of the internal state space:
+- FER: high-dimensional, non-factored, hard to interpret.
+- UFR: lower-dimensional, factored, interpretable.
+
+Pass 2 could explore whether UFR corresponds to systems with low geometric complexity (low Berry phase complexity) and FER to systems with high geometric complexity.
+
+### D.3 To `score_dynamics_giorgini_20260621` (in detail)
+
+Giorgini's score function is the gradient of the log-density. In Fields' framework:
+- A generic system can be viewed as a sample from an unknown density.
+- The score function is the gradient of the log-density in the system's state space.
+- DSM (Denoising Score Matching) estimates the score from samples.
+
+**Connection:** The score function is the gradient of the log-density. The Berry phase is the geometric phase accumulated by the system. These are different mathematical objects but both describe the system's structure.
+
+**Speculation:** The score function might be expressible as a function of the Berry phase structure. The dynamical evolution of the system is the gradient flow of the score. This is a connection worth exploring in Pass 2.
+
+### D.4 To `entropy_epiplexity_20260621` (in detail)
+
+The epiplexity talk covers Kolmogorov complexity. Fields' framework relates to complexity:
+- A generic system's internal state has high Kolmogorov complexity.
+- The boundary's projection (observable behavior) has lower complexity.
+- Polycomputation is possible because the boundary doesn't fully determine the internal state.
+
+**Connection:** Epiplexty is the observer-relative complexity of a generic system. Different observers extract different boundaries from the same system, leading to different observed complexities.
+
+### D.5 To `cs229_building_llms_20260621` (in detail)
+
+LLMs are generic systems. They have state separability (the input-output interface is a boundary). They exhibit interesting behavior (per the seven criteria). They exhibit polycomputation (many "internal models" embedded in the same observable behavior).
+
+**Connection:** The CS229 lecture's EBM (energy-based model) framework can be interpreted as Fields' generic system framework with a specific energy function. The energy function determines the geometric phase structure.
+
+### D.6 To `cs336_architectures_20260621` (planned)
+
+Modern LLM architectures are generic systems in Fields' framework. The CS336 lecture's diffusion LMs use score matching (per Giorgini) which is the gradient of the log-density of the LLM's token distribution.
+
+**Connection:** A diffusion LM is a generic system with state separability (text tokens as boundary, hidden states as Ä). The score function is the geometric phase of the hidden state. The diffusion process is the Berry phase transport.
+
+### D.7 To `creikey_dl_cv_20260621` (planned)
+
+Image diffusion models (DDPM) are generic systems with state separability (image as boundary, hidden representation as Ä). The score function is the gradient of the log-density of natural images.
+
+**Connection:** Same framework as diffusion LMs. DDPM is the visual analog.
+
+---
+
+## Appendix E — Open Questions (expanded)
+
+### E.1 Theoretical questions
+
+**E.1.1 The Platonic Space in Fields' framework.** Where does the Platonic Space (Kumar, Levin) fit in Fields' quantum formalism? Is the geometric phase structure a specific implementation of the Platonic Space? Or is the Platonic Space a different mathematical object entirely?
+
+**E.1.2 Moore's theorem and Kolmogorov violation.** Moore's theorem says finite observations can't determine internal state. Non-commuting QRFs say joint probabilities are undefined. Are these two manifestations of the same underlying principle (finite observational constraints)?
+
+**E.1.3 The role of quantum reference frames.** QRFs are the coordinate systems used to describe measurements. If QRFs don't commute, what is the "natural" coordinate system for a generic system? Is there a preferred QRF? Or are all QRFs equally valid?
+
+**E.1.4 Tipler's singularity removal.** Tipler says removing singularities from classical mechanics reproduces QM. Is the converse true: QM is the *unique* way to remove singularities? Or are there other consistent theories?
+
+**E.1.5 The nature of "interiority."** Chris Fuchs: "all physical systems have interiority." What does this mean operationally? Is interiority the same as memory (Berry phase), or is it a deeper concept?
+
+### E.2 Empirical questions
+
+**E.2.1 Moore's theorem in biological systems.** Moore's theorem says finite experiments can't determine internal state. Has this been experimentally verified in biological systems? Planaria? Xenobots? What's the smallest system for which Moore's theorem applies?
+
+**E.2.2 Conway-Kochen free will in molecular networks.** Per Fields' framework, even 4-node molecular networks (per Levin's FAR result) exhibit "free will" in the Conway-Kochen sense. Is this testable? How would one design such a test?
+
+**E.2.3 Kolmogorov violations in generic systems.** The framework predicts Kolmogorov violations for any sufficiently complex generic system. Are there empirical demonstrations? Planaria, Xenobots, or even LLMs?
+
+**E.2.4 Planarian bioelectric memory as holonomy.** Blattner 2026 formalizes bioelectric memory as Berry phase. Can this be tested experimentally? What predictions does the model make?
+
+**E.2.5 Polycomputation in LLMs.** Are LLMs polycomputers in the technical sense? Multiple computable functions embedded in their behavior? This could be tested by looking for "hidden" computations in LLMs.
+
+### E.3 Applied questions
+
+**E.3.1 Quantum-inspired AI.** QT is the foundation for diverse intelligence. Are there specific algorithmic insights from QT that could improve AI (e.g., holonomy-based computation, QRF-based context management)?
+
+**E.3.2 Brain-machine interfaces.** The framework's multi-scale formalization could inform BMI design: the boundary between brain and machine can be made explicit. Is this useful?
+
+**E.3.3 Bioelectric medicine.** The framework predicts that bioelectric perturbations (per Levin) modify the geometric phase structure. Can this be used for therapy? Birth defects? Cancer?
+
+**E.3.4 Predictability of generic systems.** The framework predicts limits on predictability. Are these limits the same as the limits observed in practice (financial markets, weather, ecology)? Or are there empirical discrepancies?
+
+### E.4 Philosophical questions
+
+**E.4.1 Is intelligence "real" or "observer-relative"?** Fields' framework treats intelligence as a structural property of any generic system. This is a strong claim. Is intelligence reduced to physics, or is there an irreducible aspect?
+
+**E.4.2 The "free will" question.** Conway-Kochen shows particles have "free will" in the sense that their outcomes are not determined by the past light cone. Does this constitute free will in the morally significant sense? Is human free will different from particle free will?
+
+**E.4.3 The Platonic Space and Fields' framework.** Fields treats generic systems as the foundational category. The Platonic Space (Kumar, Levin) is the source of patterns. Are these two frameworks compatible? Is the Platonic Space the "set of all possible generic systems"?
+
+---
+
+## Appendix F — References (full bibliography)
+
+### F.1 Primary works cited
+
+1. Levin, M., & Resnik, D. B. (2025). Mind Everywhere: A Framework for Conceptualizing Goal-Directedness in Biology and Other Domains—Part One. *Biological Theory.*
+2. Sakthivadivel, D. A. R., Friston, K., Da Costa, L., Heins, C., Pavliotis, G. A., Ramstead, M., & Parr, T. (2023). Path integrals, particular kinds, and strange things. *Physics of Life Reviews*, 47, 35-62.
+3. Friston, K., et al. (2006, 2013, 2021, 2022). Various FEP papers.
+4. Zanardi, P., & Rasetti, M. (1999). Holonomic quantum computation. *Physics Letters A*, 264, 94-99.
+5. Pachos, J., & Zanardi, P. (2001). Quantum holonomies for quantum computing. *International Journal of Modern Physics B*, 15, 1257-1286.
+6. Fields, C., & Glazebrook, J. F. (2023). Information-theoretic aspects of QRFs and holonomy. *International Journal of Theoretical Physics*, 62, 159.
+7. Blattner, M. (2026). Hidden regenerative state in planarians: A geometric model of bioelectric memory using Tangential Action Spaces. (Reference.)
+8. Moore, E. F. (1956). Gedanken-experiments on sequential machines. In *Automata Studies* (Shannon & McCarthy, eds.). Princeton University Press.
+9. Conway, J. H., & Kochen, S. (2006, 2009). The free will theorem. *Foundations of Physics*.
+10. Tipler, F. J. (2014). Quantum nonlocality from classical physics? (Reference.)
+
+### F.2 Foundational references
+
+11. Berry, M. V. (1984). Quantal phase factors accompanying adiabatic changes. *Proceedings of the Royal Society A*, 392, 45-57.
+12. Bohm, D. (1952). A suggested interpretation of the quantum theory in terms of "hidden" variables. *Physical Review*, 85, 166-193.
+13. Pearl, J. (2009). *Causality: Models, Reasoning, and Inference.* Cambridge University Press.
+14. Friston, K. (2010). The free-energy principle: a unified brain theory? *Nature Reviews Neuroscience*, 11, 127-138.
+15. Jaynes, E. T. (1957). Information theory and statistical mechanics. *Physical Review*, 106, 620-630.
+16. Fuchs, C. A. (various). QBism and the cubist interpretation of quantum theory.
+
+### F.3 Background references on free will and determinism
+
+17. Bell, J. S. (1964). On the Einstein Podolsky Rosen paradox. *Physics*.
+18. Conway, J. H., & Kochen, S. (2006, 2009). The strong free will theorem. *Notices of the AMS*.
+19. 't Hooft, G. (various). Deterministic quantum mechanics.
+
+### F.4 Background references on diverse intelligence
+
+20. Levin, M. (various). Bioelectric signaling and pattern memory.
+21. Bongard, J., & Levin, M. (various). Xenobots.
+22. Fields, C. (various). Generic systems, observational frameworks.
+
+---
+
+## Appendix G — Cross-references within campaign
+
+### G.1 Backward references
+
+- **free_lunches_levin_20260621** (§6.1.1): co-collaborator; provides biological evidence.
+- **platonic_intelligence_kumar_20260621** (§6.1.2): both invoke the concept of "real" structure in representations.
+- **score_dynamics_giorgini_20260621** (§6.3.1): score function as a generic system primitive.
+- **entropy_epiplexity_20260621** (§6.3.3): algorithmic complexity of generic systems.
+- **cs229_building_llms_20260621** (§6.3.2): LLMs as generic systems.
+
+### G.2 Forward references
+
+- **brain_counterintuitive_20260621** (planned): brain counterintuitive cases as persistent observability.
+- **neural_dynamics_miller_20260621** (planned): neural dynamics as a specific implementation of generic systems.
+- **multiscale_hoffman_20260621** (planned): multi-scale phenomena built into the framework.
+- **cs336_architectures_20260621** (planned): LLMs as generic systems with FER.
+- **creikey_dl_cv_20260621** (planned): DDPM as a generic system.
+
+### G.3 Reference dependency graph
+
+```
+foundations:
+  Plato's Forms
+       |
+       +----> Kumar: Forms = convergence target of representations
+       |
+       +----> Levin: Forms ingress into physical interfaces
+       |
+       +----> Fields: Forms = mathematical patterns in quantum theory
+
+  quantum theory
+       |
+       +----> Fields: foundation for diverse intelligence
+       |         |
+       |         +----> generic systems
+       |         |         |
+       |         |         +----> Markov blanket / separability
+       |         |         |
+       |         |         +----> geometric phase / holonomy
+       |         |         |         |
+       |         |         |         +----> memory = Berry phase
+       |         |         |         |
+       |         |         |         +----> universal computation
+       |         |         |
+       |         |         +----> Moore's theorem (1956)
+       |         |         |
+       |         |         +----> Conway-Kochen free will (2006)
+       |         |         |
+       |         |         +----> Tipler singularity removal (2014)
+       |         |         |
+       |         |         +----> persistent observability = intelligence
+
+  impossibility theorems
+       |
+       v
+  limits of predictability
+       |
+       +----> brain_counterintuitive: cognition persists with minimal brain
+       |
+       +----> free_lunches_levin: free lunches in biological systems
+       |
+       +----> cs229 / cs336 / creikey: limits of LLM/CV prediction
+```
+
+---
+
+## Appendix H — Synthesis Summary
+
+A single-paragraph TL;DR of the talk, suitable for a busy reader.
+
+Chris Fields presents a **physics-first framework** for understanding how generic systems exhibit interesting (intelligent) behavior, as part of the Diverse Intelligence Project (with Michael Levin and David Resnik). Starting from an isolated system and applying conservation laws, he derives quantum theory as the natural formalism for any generic system. The key construction: any system can be partitioned into a system A and its complement Ä separated by a boundary B; B functions as a Markov blanket if and only if A and Ä have conditionally-independent states (state separability). With separability, the Free Energy Principle's variational free energy measures interaction strength. The framework predicts that **all generic systems exhibit interesting behavior**: surprising, memory-dependent, context-dependent, and violating the Kolmogorov axioms of probability theory (joint probabilities undefined for non-commuting quantum reference frames). Three impossibility theorems jointly establish the limits of predictability: Moore's theorem (1956, finite experiments can't determine internal state), Conway-Kochen free will (2006, special relativity + QM rule out local determinism), Tipler singularity removal (2014, QM emerges from removing classical singularities). The crucial mathematical insight: non-trivial geometric phase (Berry phase) in the internal state space is a **sufficient resource for universal quantum computation** (Zanardi-Rasetti 1999). Blattner 2026 formalizes planarian bioelectric memory as holonomy in the bioelectric state space, directly bridging Fields' framework to Levin's biological evidence. The closing theorem: persistent observability (boundary maintained across interactions) is exactly equivalent to James's definition of intelligence (fixed goal + variable means).
+
+---
+
+## Appendix I — Personal Notes
+
+Things to revisit in Pass 2 (the user's de-obfuscation pass).
+
+1. **The Blattner 2026 reference** is a direct bridge between Fields' formal theory and Levin's biological observations. A deeper mathematical treatment of planarian bioelectric memory as Berry phase would strengthen the connection.
+
+2. **The relationship between the FEP and Fields' framework** deserves more attention. The FEP is a specific implementation of Fields' framework with a specific variational principle. Are there other implementations? What are the design choices?
+
+3. **The Conway-Kochen free will theorem** applies to "particles" in a specific sense. Does it apply to any generic system, or only to systems with sufficient quantum structure? What's the precise threshold?
+
+4. **The non-commuting QRF result** is the most radical prediction of the framework. Joint probability distributions are undefined. Empirical demonstrations would be very impactful. How would one test this?
+
+5. **The polycomputation theorem** implies that any sufficiently complex system implements many computations simultaneously. This is a structural property, not a limitation of analysis. Implications for AI alignment?
+
+6. **The persistent observability = intelligence** theorem is the closing claim. It's exact in the mathematical sense. Does it have empirical predictions that can be tested?
+
+7. **The connection to the Platonic Space** (Kumar, Levin) is suggestive but not formalized. Pass 2 could develop this: is the geometric phase structure a specific implementation of the Platonic Space? Or are they different mathematical objects?
+
+8. **Tipler 2014 singularity removal** is a strong claim. If QM emerges naturally from removing singularities from classical mechanics, then QM is not "weird" — it's what classical mechanics would be if it didn't have singularities. This re-frames QM in a more classical-friendly way.
+
+9. **The "interiority" concept** (Chris Fuchs) is referenced but not formalized in the talk. All physical systems have interiority — what does this mean? Is it the same as the Berry phase? A related concept?
+
+10. **The seven criteria for interesting behavior** are not independent. Are they all consequences of separability? Or are some independent of it? A formal classification would be useful.
+
+---
+
+## Appendix J — Glossary
+
+| Term | Definition |
+|---|---|
+| **Diverse Intelligence Project** | Research program (Levin, Resnik, Fields) studying intelligence across substrates. |
+| **Generic system** | Any interacting system, regardless of scale, structure, or composition. |
+| **William James definition** | "Intelligence is a fixed goal achievable with variable means." |
+| **Quantum theory** | The natural formalism for any isolated system; characterized by unitarity, linearity, Hilbert space. |
+| **Isolated system U** | A system with no environment; conserves momentum, energy, information. |
+| **Hamiltonian HU** | The energy operator of U. TU(t) = exp((-i/ℏ)HU·t). |
+| **Markov blanket** | A boundary B between A and Ä such that A and Ä are conditionally independent given B. |
+| **State separability** | Joint state factorizes: \|ψ⟩AÄ = \|ψ⟩A ⊗ \|ψ⟩Ä. |
+| **Weak coupling** | dim(HAÄ) ≪ dim(HA), dim(HÄ). Required for separability. |
+| **Variational free energy (VFE)** | FEP quantity; in Fields' framework, measures interaction strength. |
+| **FEP** | Free Energy Principle (Friston). Random dynamical systems as inferential. |
+| **Persistent observability** | Boundary B maintained across interactions. Equivalent to intelligence. |
+| **Berry phase** | Geometric phase accumulated by a quantum system transported around a closed path. Represents internal memory. |
+| **Holonomy** | Non-trivial geometric phase. Sufficient resource for universal quantum computation. |
+| **Polycomputation** | Multiple distinct computable functions embedded in the same observable behavior. |
+| **Moore's theorem (1956)** | Finite input-output experiments can't determine internal state-transition probabilities. |
+| **Conway-Kochen theorem** | Special relativity + QM rule out local determinism. "If experimenters make choices, electrons do too." |
+| **Tipler singularity removal (2014)** | QM emerges from removing singularities from classical physics. |
+| **Quantum Reference Frame (QRF)** | Local coordinate system on the boundary. Non-commuting QRFs generate non-causal context dependence. |
+| **Kolmogorov violation** | Joint probability distribution undefined due to non-commuting measurements. |
+| **Planarian bioelectric memory** | Pattern memory stored as Berry phase in the bioelectric state space (Blattner 2026). |
+| **Universal quantum computation** | Any unitary on a finite Hilbert space can be implemented; requires SU(2) + entangling gates. |
+| **Blattner model** | Geometric model of planarian bioelectric memory using Tangential Action Spaces. |
+| **Polycomputation theorem** | Any generic system with state separability exhibits polycomputation. |
+| **Interiority** | Chris Fuchs: "all physical systems have interiority." Related to Berry phase / internal memory. |
+| **Quantum Reference Frames (QRFs)** | Local coordinate systems on the boundary. |
+| **Information geometry** | The geometry of probability distributions; related to Berry phase via the score function. |
+
+---
+
+*End of report. Lossless preservation per umbrella spec §0. Pass 2 (de-obfuscation) and Pass 3 (projection to applied domain) to follow.*
diff --git a/conductor/tracks/video_analysis_generic_systems_fields_20260621/summary.md b/conductor/tracks/video_analysis_generic_systems_fields_20260621/summary.md
new file mode 100644
index 00000000..08b54c36
--- /dev/null
+++ b/conductor/tracks/video_analysis_generic_systems_fields_20260621/summary.md
@@ -0,0 +1,25 @@
+# Summary: Interesting Behavior by Generic Systems (Fields)
+
+**Source:** https://youtu.be/QeMajYvhEbI
+**Author:** Chris Fields (Allen Discovery Center collaborator)
+**Track:** Child #7 of `video_analysis_campaign_20260621`
+**Cluster:** C (Biological / cognitive / generic systems)
+**Pass:** 1 of 3 (research-only deep-dive)
+
+---
+
+## One-paragraph synthesis
+
+Fields presents a **physics-first framework** for understanding how generic systems exhibit interesting (intelligent) behavior, as part of the Diverse Intelligence Project (with Michael Levin and David Resnik). Starting from an isolated system and applying conservation laws, he derives quantum theory as the natural formalism for any generic system. Any system can be partitioned into A and its complement Ä separated by a boundary B; B functions as a Markov blanket iff A and Ä have conditionally-independent states (state separability). The framework predicts **all generic systems exhibit interesting behavior** — surprising, memory-dependent, context-dependent, Kolmogorov-violating. Three impossibility theorems establish limits of predictability: Moore's theorem (1956, finite experiments can't determine internal state), Conway-Kochen free will (2006, no local determinism), Tipler singularity removal (2014, QM from removing classical singularities). The crucial insight: non-trivial geometric phase (Berry phase) in the internal state space is a **sufficient resource for universal quantum computation** (Zanardi-Rasetti 1999). Blattner 2026 formalizes planarian bioelectric memory as holonomy, directly bridging to Levin's biological evidence. The closing theorem: persistent observability is exactly equivalent to James's definition of intelligence. **Backward connections:** free_lunches_levin (co-collaborator), platonic_intelligence_kumar, score_dynamics_giorgini, entropy_epiplexity, cs229. **Forward connections:** brain_counterintuitive (persistent observability predicts brain reductions with normal cognition), neural_dynamics_miller, multiscale_hoffman, cs336, creikey.
+
+---
+
+## Three key takeaways
+
+1. **Quantum theory is the natural formalism for any generic system** — starting from an isolated system (no environment), conservation laws force unitarity → linearity → Hilbert space → QT. The boundary between a system and its environment is a Markov blanket when the systems have conditionally-independent states. This is the formal foundation for the Diverse Intelligence Project.
+2. **All generic systems exhibit interesting behavior** — surprising, memory-dependent, context-dependent, Kolmogorov-violating. The framework predicts these via state separability + non-commuting quantum reference frames. Berry phase (geometric phase) represents internal memory; non-trivial Berry phase is sufficient for universal quantum computation. Persistent observability = intelligence (theorem).
+3. **Three impossibility theorems establish predictability limits** — Moore (finite experiments can't determine internal state), Conway-Kochen (no local determinism), Tipler (QM from singularity removal). Blattner 2026 formalizes planarian bioelectric memory as holonomy — bridging Fields' formal theory to Levin's biological observations.
+
+---
+
+*Pass 2 (de-obfuscation via user's mathematical encoding) to follow.*