Life as we know it

Reference: Friston, K. (2013). Life as we know it. Journal of the Royal Society Interface, 10(86):20130475. (The Wellcome Trust Centre for Neuroimaging, Institute of Neurology, University College London.) DOI: 10.1098/rsif.2013.0475. PMID 23825119; PMCID PMC3730701. URL.

Summary

This is the anchor statement of the Free Energy Principle: the paper offers what Friston calls a heuristic proof — accompanied by simulations of a primordial soup — that life, understood as biological self-organisation, is “an inevitable and emergent property of any (ergodic) random dynamical system that possesses a Markov Blanket.” The setting is a Random Dynamical System: states flow under a deterministic vector field perturbed by random fluctuations, described by a stochastic differential equation. The ergodic assumption is what buys the interpretive leverage — over sufficient time the system’s trajectory visits states in proportion to an invariant ergodic density, so how long a system spends in a state can be read as how probable that state is for that system. Under ergodicity the long-term average of surprise (the negative log probability of a state) is the entropy of the ergodic density, and a system that persists is, definitionally, one whose states remain in a small, characteristic set.

The argument then turns on a statistical rather than a thermodynamic boundary. If coupling among an ensemble of subsystems is mediated by short-range forces, the states of remote subsystems must be conditionally independent; these independencies induce a Markov blanket separating internal from external states. The blanket itself splits by the direction of influence, giving the fourfold partition the paper is famous for: external states ψ (states of the world that cause sensory states and depend on action), sensory states s (a probabilistic mapping from external states and action), active states a (which depend on sensory and internal states), and internal states λ (which cause action and depend on sensory states). Internal and external states are thereby d-separated: they can influence each other only through the blanket, and so each is condemned to know the other only by inference. Applying a Helmholtz Decomposition to the flow of the ergodic density (whose evolution obeys the Fokker-Planck Equation) separates it into a gradient descent on the Gibbs energy G = −ln p(ψ,s,a,λ) plus a divergence-free solenoidal component. Read against that decomposition, the flow of internal states appears to perform a gradient descent on a variational free energy — a functional of an arbitrary variational density q(ψ|λ) parametrised by the internal states, and a quantity that upper-bounds surprise. Because this is exactly the quantity optimised in variational Bayesian inference, the internal states appear to encode posterior beliefs about external causes, while the active states appear to change the world so that sensations conform to those beliefs. Internal states plus their blanket therefore “appear to engage in active Bayesian inference”: to model, and act on, their world so as to preserve their functional and structural integrity — homoeostasis and a simple form of autopoiesis. Friston is consistently careful to use as-if language: the inference is an appearance forced by the geometry of the dynamics, not an explicit representational computation posited inside the system.

The primordial soup simulation illustrates the emergence rather than proving it. An ensemble of 128 elemental subsystems is given two coupled sets of dynamics: Newtonian motion under a strong inverse-square repulsive force and a weaker attractive force that depends on the subsystems’ electrochemical states; and electrochemical dynamics chosen to have a Lorenz attractor, coupled only to spatial neighbours through an adjacency matrix. Heterogeneity is introduced by randomly selecting a third of the subsystems and preventing them from electrochemically influencing others (zeroing the corresponding column of the adjacency matrix), making them “functionally closed.” From random initial conditions the ensemble self-organises: a cluster of internal subsystems forms, enclosed by a membrane-like layer of sensory and active subsystems — a Markov blanket that was nowhere specified in the equations of motion. The internal electrochemical states come to predict the external structural states, which is precisely the appearance of a generative model.

Key Ideas

The thesis: any ergodic random dynamical system possessing a Markov blanket will appear to minimise a variational free energy functional of its blanket states, hence appear to engage in active Bayesian inference. Life is presented as an inevitable consequence of that setup, not an additional assumption.
Ergodicity as the interpretive bridge: if time-averages converge, state occupancy is probability. A system that persists occupies a small set of states, so persistence = low long-term average surprise = low entropy of the ergodic density.
Short-range forces ⇒ conditional independence ⇒ a Markov blanket. The boundary is statistical, derived from the sparsity of coupling, not stipulated as a physical membrane.
The fourfold partition: external ψ, sensory s, active a, internal λ. Sensory states are caused by external states; active states are caused by internal states; internal and external states are d-separated by the blanket {s, a} and can reach each other only through it.
Helmholtz decomposition of the flow: the flow of the ergodic density splits into a gradient descent on Gibbs energy G(ψ,s,a,λ) = −ln p(ψ,s,a,λ) and a solenoidal (divergence-free) circulation on its isocontours.
Free energy bounds surprise: F(s,a,λ) is a functional of a variational density q(ψ|λ) parametrised by internal states; by Gibbs’ inequality the gap between free energy and surprise is a non-negative divergence, so minimising F both bounds surprise and drives q toward the true posterior over external causes.
Active Inference has two limbs: internal states minimise free energy by changing beliefs (perception); active states minimise it by changing the world so that sensory states conform to those beliefs (action). Together they place an upper bound on the dispersion of the system’s states.
The model is not chosen — it is the environment’s own density. The generative model is implicit in p(ψ,s,a,λ), the invariant density of the very system being described. There is no free hand to posit a mistaken model.
“Appear to” is load-bearing. Friston does not claim systems do Bayesian inference; he claims their dynamics are indistinguishable from a system that does. The inferential vocabulary is a description that the mathematics licenses, not a mechanism it postulates.
Primordial soup simulation: 128 subsystems, Newtonian mechanics (inverse-square repulsion, weaker electrochemically-dependent attraction) plus Lorenz-attractor electrochemical dynamics coupled through local adjacency; a randomly chosen third made functionally closed. A Markov blanket — internal core, sensory/active membrane — self-organises out of random initial conditions.
Autopoiesis without teleology: homoeostasis and structural integrity fall out as consequences of the dynamics, rather than being written in as objectives.

Connections

Conceptual Contribution

Claim: Any ergodic random dynamical system that possesses a Markov blanket will appear to minimise a variational free energy functional of its blanket states — an upper bound on the surprise of those states — and therefore will appear to engage in active Bayesian inference: to model, and act upon, its world so as to preserve its structural and functional integrity. Biological self-organisation, on this account, is not an extra ingredient added to physics but an inevitable appearance of it wherever a statistical boundary exists.
Mechanism: Model the ensemble as a stochastic differential equation with random fluctuations and assume ergodicity, so that the system has an invariant density whose evolution obeys the Fokker–Planck equation. Observe that short-range coupling makes remote subsystems conditionally independent, inducing a Markov blanket; partition states into external ψ, sensory s, active a and internal λ, with {s, a} d-separating λ from ψ. Apply a Helmholtz decomposition to the flow, splitting it into a gradient descent on Gibbs energy G = −ln p(ψ,s,a,λ) and a solenoidal component. Recast the internal-state flow as gradient descent on a free energy F(s,a,λ) defined over a variational density q(ψ|λ) parametrised by internal states; Gibbs’ inequality makes F an upper bound on surprise, whose minimisation drives q toward the posterior p(ψ|s,a). Perception is then the internal-state limb of this descent and action the active-state limb. Illustrate with 128 coupled subsystems (Newtonian motion + Lorenz electrochemical dynamics, a third of them functionally closed), in which a Markov blanket with a membrane-like sensory/active boundary emerges spontaneously.
Concepts introduced/used: Markov Blanket, Free Energy Principle, Active Inference, Variational Free Energy, Surprisal, Ergodicity, Random Dynamical System, Fokker-Planck Equation, Helmholtz Decomposition, Generative Model, Autopoiesis, Bayesian Filtering
Stance: formal theory / heuristic proof with illustrative simulation (no empirical study; the simulation demonstrates emergence, it does not establish the general claim)
Relates to: Provides the canonical formulation against which Interpreting Systems as Solving POMDPs positions itself. Biehl & Virgo require only that an ascription of beliefs and goals be consistent with a system’s dynamics — an agent may hold an outright wrong model of its environment and still qualify, because the interpretation’s hidden states and rewards need have no physical realisation and existence of the interpretation depends on the machine alone. Here the opposite holds: the generative model is not chosen by an interpreter but derived from the actual environment’s dynamics — it simply is the invariant density p(ψ,s,a,λ) of the coupled system — so it cannot come apart from the world it models, and the question of a wrong model does not arise. Consistency versus correctness is exactly the axis of difference; a further one is that Biehl & Virgo demand exact Bayesian updating whereas the FEP is built around approximate (variational) inference. The Markov blanket construction inherits its conditional-independence machinery from Pearl (Causality - Pearl, Causal Diagrams for Empirical Research - Pearl). The account of persistence and boundary formation answers, in dynamical-systems terms, the self-maintenance questions posed by Theory of Self-Reproducing Automata, and it offers a reading of agent-talk that neither asserts explicit internal representation — cf. Intelligence Without Representation — nor merely licenses it pragmatically as True Believers - The Intentional Strategy and Why It Works does; the inferential description is instead forced by the geometry of the flow.

Tags

#foundational #active-inference #free-energy-principle #markov-blanket #bayesian-inference #dynamical-systems #agency #self-organisation

Backlinks

Linked Pages

True Believers - The Intentional Strategy and Why It Works

True Believers: The Intentional Strategy and Why It Works

Reference: Dennett, D. C. (1981). In A. F. Heath (Ed.), Scientific Explanations, Oxford University Press. Reprinted in The Intentional Stance (1987, MIT Press, ch. 2) and in Mind Design II (1997). Source file: dennett_true_believers.pdf. URL

Summary

Dennett’s canonical defence of the intentional stance: a predictive strategy in which one treats a system as a rational agent with beliefs and desires, works out what a rational agent so situated ought to do, and predicts it will do that. The stance is contrasted with the physical stance (predict from physical laws and microstructure) and the design stance (predict from presumed function). Belief is a perfectly objective phenomenon, but one discernible only from the point of view of an adopter of this strategy; a system is a true believer just in case its behaviour is reliably predictable by intentional ascription.

Dennett argues this vindicates a “mild realism” (or “interpretationism”) about belief against both hard-core realism (beliefs as sentence-like tokens in the head) and eliminativism. The remarkable empirical fact is that the intentional strategy works — on people, animals, chess programs, even thermostats (in a degenerate way) — because evolution and engineering produce systems whose behaviour tracks their interests given accurate beliefs. This pattern of success is what there is to being a believer; no further fact about inner sentential structure is required. The paper grounds the philosophical licence to ascribe mental states to artificial agents and thus underwrites the mentalistic vocabulary of agent theory.

Key Ideas

Three stances: physical, design, intentional.
Intentional strategy: assume rationality, compute ought-to-do, predict.
True believer = system reliably predicted by the intentional strategy.
Belief is objective but stance-relative (mild realism / interpretationism).
Natural selection explains why the strategy works on organisms.
Thermostats as degenerate (but continuous) intentional systems.
Licence for mentalistic ascription to artificial agents.

Connections

Conceptual Contribution

Claim: Beliefs and desires are objective but stance-relative — a system genuinely has them just in case adopting the intentional strategy (assume rationality with appropriate beliefs/desires and predict accordingly) reliably predicts its behaviour.
Mechanism: Dennett distinguishes physical, design, and intentional stances; defines the intentional strategy operationally (attribute beliefs the system ought to have given its perceptual and epistemic history, attribute desires it ought to have given its biological/functional role, predict the rational action); argues success of the strategy on people, animals, and artefacts is an empirical fact explained by evolutionary/design pressures, and that this success is all there is to being a believer — no further requirement of language-of-thought tokens.
Concepts introduced/used: Intentional Stance, True Believer, Mild Realism, Design Stance, Physical Stance, Rationality Assumption
Stance: philosophical theory
Relates to: Justifies the ascription of BDI mental states to artificial systems in Modeling Rational Agents within a BDI-Architecture, Intelligent Agents Theory and Practice and Agent-Oriented Programming; cohabits with Two Faces of Intention as a pillar of agent-theoretic philosophy; foreshadows functional-role arguments in Society of Mind.

Tags

Intelligence Without Representation

Reference

Brooks, Rodney A. (1991). “Intelligence without representation.” Artificial Intelligence 47: 139–159. (Received September 1987.)
PDF: people.csail.mit.edu/brooks/papers/representation.pdf
Local: brooks1991_representation.pdf

Summary

Brooks challenges the dominant symbol-manipulation paradigm of classical AI, arguing that “representation is the wrong unit of abstraction in building the bulkiest parts of intelligent systems.” Drawing on an evolutionary argument — 3.5 billion years were spent evolving sensorimotor and survival competence, and only a few thousand years on “expert” symbolic knowledge — he claims the hard part of intelligence is mobility, vision, and acting in dynamic environments, not the formal problem-solving that dominated early AI. The “blocks-world” style of AI succeeds only because researchers have already factored out perception and motor action, relegating them to input/output black boxes.

In place of centralized symbolic architectures, Brooks proposes building autonomous mobile robots he calls “Creatures,” decomposed by activity rather than by function. Each activity-producing layer connects sensing to action directly and runs in parallel; higher layers are incrementally added on top of lower, already-working layers without a central symbolic world model. This is the subsumption architecture. The slogan is “the world is its own best model”: rather than maintaining an internal representation the robot re-perceives what it needs.

The paper’s philosophical payload is a rejection of the sense–model–plan–act pipeline and of the assumption that intelligence can be decomposed into modules trading symbolic messages. Brooks argues this methodological commitment — that perception delivers a human-style Merkwelt that central reasoning can operate on — is a form of self-deception, since each species and each robot inhabits its own Merkwelt. Intelligence is to be built bottom-up, situated and embodied, tested continuously against the real world.

Key Ideas

Situatedness and embodiment as design primitives: Creatures must cope with a dynamic environment and have some purpose in being.
Decomposition by activity, not function: layers of task-achieving behavior (avoid, wander, explore) replace perception → modeling → planning → action pipelines.
Subsumption architecture: higher competence layers inhibit/subsume lower ones while lower continue running.
No central representation: “the world is its own best model”; no shared symbolic world model between layers.
Evolutionary time argument: sensorimotor intelligence is the hard, ancient core; symbolic expertise is a thin late veneer.
Critique of abstraction: abstracting away perception and action is how AI self-deceives about having solved problems.
Hypothesis (H): representation is the wrong primitive for building intelligent systems.

Connections

Subsumption Architecture — this paper is the manifesto.
Intelligent Agents Theory and Practice — Wooldridge & Jennings use Brooks as the exemplar of reactive agents, contrasted with deliberative BDI agents.
The Society of Mind — shares the anti-monolithic, many-small-agents intuition, though Minsky retains representations.
Multi-Agent Systems — reactive/behavior-based approaches feed directly into swarm and MAS work.
Actor Model — independent parallel activity producers without a central controller.
A Universal Modular Actor Formalism for Artificial Intelligence — kindred rejection of centralized control.
Agent Architecture — subsumption is a canonical architecture contrasted with BDI, layered, hybrid.
Contrast with Knowledge Representation, Ontologies, Advice Taker — papers that double down on representation.

Conceptual Contribution

Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata (Fourth Lecture: The Role of High and of Extremely High Complication)

Reference: von Neumann, J. (edited and completed by Arthur W. Burks) (1966). University of Illinois Press. Source file: VonNeumann.pdf. URL

Summary

This excerpt is the Fourth Lecture of von Neumann’s posthumously edited Theory of Self-Reproducing Automata. Von Neumann compares natural automata (nervous systems) with artificial computing machines across size, speed, energy dissipation per elementary act of information, and error characteristics. He observes that although vacuum tubes are vastly larger and less energy-efficient than neurons, both are far above the thermodynamic minimum — suggesting physics does not fully explain the size gap; reliability likely does.

The core argument concerns complication: below a threshold, a system cannot perform certain tasks at all; above it, qualitatively new behaviors (including self-reproduction and evolution) become possible. Natural automata tolerate errors locally rather than halting on any single fault, an architectural stance he contrasts with the “single-error” fragility of contemporary computers. The discussion foreshadows modern views on redundancy, fault tolerance, and emergent capabilities with scale.

Key Ideas

Complication threshold enables qualitatively new behavior.
Natural automata survive local errors; artificial automata halt.
Analog-digital mixture characterizes biological computation.
Size and reliability trade-offs shape architecture.
Precursor to self-reproducing and evolvable systems theory.

Connections

Self-Adaptive Systems
Multi-Agent Systems
Edge Intelligence
Large Population Models
ClawWorm Self-Propagating Attacks Across LLM Agent Ecosystems — modern self-replicating agent, direct lineal descendant
Myconet Fungi Inspired Superpeer Overlay — biological self-organisation
Computational Boundary of a Self — selfhood extended to scale-free cognition
Programming Erlang Second Edition — engineered local-error-tolerance

Conceptual Contribution

Claim: There exists a threshold of “complication” below which automata can only degrade and above which qualitatively new capacities (self-reproduction, evolvable organisation) become possible; biological automata survive precisely because their architecture tolerates local error rather than halting on any single fault.
Mechanism: Von Neumann juxtaposes nervous systems and vacuum-tube computers along size, energy-per-information-act, speed, and error characteristics, noting both far exceed thermodynamic minima so the gap must be architectural. He then argues that digital-analog hybrids with distributed redundancy exhibit error-tolerant behaviour that Turing-style halting-on-first-error machines cannot match, and frames this as a prerequisite for crossing the complication threshold that enables open-ended evolution.
Concepts introduced/used: Complication Threshold, Self-Reproducing Automata, Fault Tolerance, Redundancy, Digital-Analog Hybrid, Error Halting, Natural vs Artificial Automata
Stance: foundational
Relates to: A philosophical wellspring for the “let it crash” supervision of Programming Erlang Second Edition, the fault-tolerance patterns of Architectural Patterns for Dependable Software Systems - SOL, the robustness concerns of Are Multiagent Systems Resilient to Communication Failures, and the emergent-complexity framing behind Computational Boundary of a Self.

Tags

Causal Diagrams for Empirical Research - Pearl

Causal Diagrams for Empirical Research

Reference: Pearl, J. (1995). Causal Diagrams for Empirical Research. Biometrika 82(4): 669–688. December 1995. With discussion and rejoinder. URL (UCLA CogSys Lab) · DOI

Summary

Pearl’s Causal Diagrams is the paper in which the modern graphical apparatus of causal inference takes recognisable shape: directed acyclic graphs (DAGs) over observed and latent variables as the carrier of non-parametric causal assumptions, the do-operator as the formal representation of intervention, and the backdoor criterion as the first widely-usable graphical test for whether a causal effect is identifiable from observational data given a set of measured covariates. Where the early structural-equations and path-analysis tradition (Wright 1921, Haavelmo 1943) had given causal interpretations to specific parametric models, and where the do-then-randomise tradition (Rubin 1974) had given a counterfactual semantics to causal effects without graphs, Pearl unifies both: the DAG carries the structural assumptions, the do-operator gives the counterfactual semantics, and a small algebra of graphical operations decides identifiability.

The mechanism is precise. A causal model is a DAG G over variables V together with structural equations or, more generally, a non-parametric structural model. The do-operator do(X = x) represents the intervention that sets X to x regardless of X’s natural causes — graphically, by severing the incoming edges to X in G. A causal effect P(Y | do(X = x)) is identifiable from observational data over V iff it can be written as an expression in the observational distribution P(V). The backdoor criterion gives a sufficient condition: a set Z of measured covariates is admissible for adjustment iff Z blocks every backdoor path from X to Y (every path with an arrow into X) and contains no descendants of X. When Z is admissible, P(Y | do(X = x)) = ∑_z P(Y | X = x, Z = z) P(Z = z) — the backdoor adjustment formula. The paper also introduces the front-door criterion for cases where backdoor adjustment fails but a mediator can be exploited.

For the CBCL / CIVeX programme, Pearl 1995 is the foundation. CIVeX certificates carry a DAG of causal assumptions and a proof that the queried effect is identifiable from the available data under those assumptions; this is exactly what Pearl establishes is expressible and checkable. The paper is also a methodological complement to the PCC architecture in CBCL: where PCC ships behavioural proofs, CIVeX ships causal-identification proofs, and both are checked against a stated specification rather than re-derived. The completion of the graphical identifiability story — characterising exactly which causal effects are identifiable in the presence of unobserved confounders — is Shpitser & Pearl 2006’s complete-ID algorithm; Pearl 1995 is the place the story starts to look like an algorithm rather than a case-by-case analysis.

Key Ideas

Causal DAG as non-parametric structural model: a DAG G over V together with structural equations (or a non-parametric Markov-compatible distribution). The DAG carries the causal assumptions; the distribution is what is observed.
do-operator: do(X = x) represents intervention — setting X to x by external manipulation, severing the natural mechanisms that determine X. Graphically: delete incoming edges to X in G; semantically: replace X’s structural equation with X := x. The post-intervention distribution P(V | do(X = x)) is the central object of causal inference.
Identifiability: a causal query P(Y | do(X = x)) is identifiable from observational data over V iff it can be written as an expression in P(V). Identifiability is a graphical property — it depends only on the DAG, not on the specific distribution.
Backdoor criterion: Z ⊆ V is admissible for adjustment iff (i) no node in Z is a descendant of X in G, and (ii) Z blocks every backdoor path from X to Y (every path with an arrow into X). When Z is admissible, P(Y | do(X = x)) = ∑_z P(Y | X = x, Z = z) P(Z = z).
Front-door criterion: when no admissible Z for backdoor adjustment exists, identification may still be possible via a mediator M on the directed path from X to Y. The front-door formula uses M to identify the effect even in the presence of unobserved confounders.
Markov compatibility / d-separation: G constrains P(V) via conditional-independence statements encoded by d-separation — a purely graphical criterion. The empirical content of a causal DAG is exactly the d-separations it implies.
Bridge to interventions: causal effects can be defined purely structurally (no counterfactual ontology needed) by reference to the post-intervention distribution. Counterfactuals re-enter when finer-grained queries (mediation, attribution) are asked, handled by structural causal models in Pearl’s later work.

Connections

Conceptual Contribution

Claim: Causal effects can be represented graphically (as DAGs over observed and latent variables) and identified from observational data by a calculus of graphical operations. The do-operator gives the formal semantics of intervention; the backdoor and front-door criteria give algorithmic identifiability conditions.
Mechanism: Encode causal assumptions as a DAG G over V. Define interventions via the do-operator, semantically the surgical replacement of X’s structural equation by X := x and graphically the severing of incoming edges. State identifiability as the existence of an expression in P(V) for P(Y | do(X = x)). Give the backdoor criterion as a sufficient graphical condition (block all backdoor paths, no descendants of X) together with the backdoor adjustment formula. Give the front-door criterion for the harder case of unmeasured confounding. The result is a non-parametric, graph-driven, algorithmic theory of causal identification.
Concepts introduced/used: do-Calculus, Causal DAG, Structural Causal Model, Intervention, Backdoor Criterion, Front-door Criterion, d-Separation, Identifiability, Markov Compatibility.
Stance: foundational technical paper.
Relates to: Pearl’s compact statement of the apparatus developed at book length in Causality (2000/2009); the algorithmic completion is Shpitser & Pearl 2006. The complementary tradition is Rubin’s potential-outcomes framework (1974) — the same causal effects in counterfactual notation; later work (Pearl–Bareinboim, Imbens–Rubin) establishes formal mappings between the two. For CBCL and CIVeX, this is the substrate: a CIVeX certificate carries a DAG and a proof of identifiability under stated assumptions, checked by the host rather than re-derived. The pairing with PCC is exact: PCC ships behavioural proofs over machine states; CIVeX ships causal-identification proofs over the DAG. The d-separation / Markov-compatibility connection grounds the bridge to probabilistic graphical models more broadly.

Causality - Pearl

Causality: Models, Reasoning, and Inference

Reference: Pearl, J. (2000, 2nd ed. 2009). Causality: Models, Reasoning, and Inference. Cambridge University Press. 384 pp (1st ed.) / 484 pp (2nd ed.). URL (ILLC Amsterdam, 2nd ed. PDF) · Cambridge UP page · Internet Archive

Summary

Causality is the book-length statement of Pearl’s graphical-causal-inference programme — the work that fixes a usable vocabulary for causation in the empirical sciences, replacing decades of philosophical regress with a constructive theory. The book extends the apparatus of Causal Diagrams for Empirical Research (1995) along three axes. (1) From interventional to counterfactual causal queries: the structural causal model (SCM) — a system of structural equations with exogenous error terms — supports queries about what would have happened if particular variables had taken different values, not only about intervention distributions. (2) From backdoor / front-door criteria to do-calculus: a complete deductive system (three rules: insertion/deletion of observations, action/observation exchange, and insertion/deletion of actions) for transforming do-expressions. Together with Shpitser & Pearl 2006’s completeness result, do-calculus is complete for non-parametric identifiability. (3) From identifiability to applied causal inference: chapters on confounding, mediation, instrumental variables, the actual-cause problem, and the foundations of legal-causal reasoning.

The technical core in three layers. Layer 1 (association): ordinary probabilistic conditional P(Y | X). Layer 2 (intervention): post-do distribution P(Y | do(X = x)), derived from the SCM by surgical replacement of X’s equation. Layer 3 (counterfactuals): queries like P(Y_{X=x} | X = x', Y = y') — “given that we observed X = x' and Y = y', what would Y have been if we had set X = x?” — derived by the abduction–action–prediction procedure: update exogenous-error distributions on the evidence, intervene on X, predict Y. Pearl calls this stratification the Ladder of Causation; the book argues that the climb from layer 1 to layer 3 is a matter of added assumptions (structural equations, then exogenous-error distributions), not of finer-grained statistical methodology.

For CBCL and CIVeX, the book is the textbook reference. CIVeX certificates carry a DAG, a stated set of structural assumptions, and a do-calculus derivation establishing identifiability of the target causal query. The host’s verifier checks the derivation against the do-calculus rules. The completeness of do-calculus (Shpitser & Pearl 2006) means that the verifier never has to apologise for being too weak: if the effect is identifiable at all, do-calculus derives it. The book also supplies the vocabulary for stating what CIVeX certificates are claiming: distinctions between association, intervention, and counterfactual; between identifiability and estimability; between confounding, mediation, and selection — all of which are needed to write precise threat models for causal claims in multi-agent settings.

Key Ideas

Structural Causal Model (SCM): a system of structural equations Vᵢ := fᵢ(PAᵢ, Uᵢ) over endogenous variables V with exogenous errors U, plus a distribution over U. The SCM is the formal carrier of all three causal layers.
Ladder of Causation: three layers of causal queries, each requiring strictly more assumptions. Layer 1 (seeing) — P(Y | X). Layer 2 (doing) — P(Y | do(X = x)). Layer 3 (imagining) — counterfactuals P(Y_{X=x} | E) for arbitrary evidence E.
do-calculus: three syntactic transformation rules over do-expressions: (R1) insertion/deletion of observations under d-separation; (R2) action/observation exchange under modified d-separation; (R3) insertion/deletion of actions under absence-of-causal-paths. Combined with probability axioms, the calculus is complete for non-parametric identifiability (Shpitser–Pearl 2006).
Identifiability under unobserved confounders: many effects are identifiable even when key confounders are unmeasured. The do-calculus discovers when, and the Shpitser–Pearl ID algorithm gives a complete procedure.
Counterfactual queries by abduction–action–prediction: (i) Update P(U) on observed evidence (abduction). (ii) Intervene on the SCM (action). (iii) Compute the distribution of the target variable (prediction). The procedure yields counterfactuals from the SCM.
Mediation analysis: natural direct, natural indirect, and total effects decompose causal influence along specific paths. Identification conditions are characterised by the mediation formula and the more general path-specific effects.
Instrumental variables: a classical econometric tool given a clean graphical characterisation — an instrument is a variable affecting X but not Y directly or via unmeasured confounders. The IV estimand is recoverable when the graphical conditions hold.
Actual cause / responsibility: chapter 10 develops a formal theory of actual causation — what actually caused the outcome in this token case? — built on counterfactuals and contingency. Foundational for legal and AI-ethics applications.
Transportability: under what conditions can a causal effect estimated in one population be transferred to another? Bareinboim–Pearl give graphical criteria.

Connections

Conceptual Contribution

Claim: Causal reasoning admits a precise, computable, non-parametric foundation built on structural causal models (SCMs), the do-operator for intervention, and the do-calculus for transforming causal queries. The three-layer Ladder of Causation (association / intervention / counterfactual) stratifies the assumptions required for each kind of causal claim.
Mechanism: Define SCMs as systems of structural equations with exogenous errors. Define interventions surgically (replace X’s equation by X := x). Define counterfactuals via abduction–action–prediction on the SCM. Give the do-calculus (three transformation rules) and show it is sound; later work (Shpitser–Pearl 2006) shows it is also complete for identification. Extend to mediation, instruments, actual causation, transportability across populations.
Concepts introduced/used: Structural Causal Model, Ladder of Causation, do-Calculus, Counterfactual, Mediation Analysis, Instrumental Variable, Actual Cause, Transportability, Identifiability.
Stance: foundational technical monograph / textbook.
Relates to: The book that the paper Causal Diagrams (1995) prefigures and that Shpitser & Pearl 2006 completes algorithmically. The complementary framework is Rubin’s potential outcomes (1974): the same causal effects in counterfactual notation, with explicit formal mappings between the two languages (Pearl–Bareinboim 2009). For CBCL / CIVeX, the book is the textbook reference: CIVeX certificates carry DAGs, structural assumptions, and do-calculus derivations of identifiability; the host’s verifier checks the derivation against the calculus. The PCC pairing is exact (Necula): PCC ships behavioural proofs over machine states; CIVeX ships causal-identification proofs over the DAG; both rely on small, generic verifiers that check rather than re-derive.

Interpreting Systems as Solving POMDPs

Interpreting systems as solving POMDPs: a step towards a formal understanding of agency

Reference: Biehl, M. & Virgo, N. (2022). Interpreting systems as solving POMDPs: a step towards a formal understanding of agency. Proceedings of the 3rd International Workshop on Active Inference (IWAI 2022); published in Active Inference. IWAI 2022, Communications in Computer and Information Science, vol. 1721, Springer, Cham. arXiv:2209.01619 (Cross Labs / Cross Compass, Tokyo; Earth-Life Science Institute, Tokyo Institute of Technology). URL.

Summary

When is a physical system entitled to be described as having beliefs and goals? Biehl and Virgo answer with a consistency criterion rather than a predictive one. Their starting point is Dennett’s Intentional Stance, which licenses agent-talk when it out-predicts the Physical Stance. The authors explicitly depart from this comparison-of-stances approach: assuming we already know what the system does at the physical level, they ask whether we can consistently ascribe meaning to its physical states such that those states appear to implement belief updating and decision making. This builds directly on Virgo, Biehl & McGregor’s earlier notion of interpreting a dynamical system as a Bayesian reasoner — something that takes inputs and makes inferences about a hidden variable, but that has neither goals nor actions. The present paper’s contribution is to extend consistent interpretation to cover goals and actions, and thereby to reach agents.

Three deliberate conceptual commitments make this precise. The system is taken to be a stochastic Moore machine (M, I, O, μ, ω) — internal states, inputs, outputs, a stochastic machine kernel, and a deterministic expose function; the authors note this is far from the most general system but is general enough to cover the digital computers running most present-day artificial agents. Beliefs are probability distributions updated in accordance with Bayes’ law. Goals and rationality come from POMDPs, which supply both a formal notion of goal (expected cumulative discounted reward maximisation) and of rational behaviour (the optimal policy). The technical machinery is a consistent Bayesian influenced filtering interpretation (Def. 3): a hidden state space H, an action space A, an interpretation map ψ : M → PH sending machine states to beliefs over hidden states, an action function α : M → A, and a model kernel κ : H × A → P(H × I). A stochastic Moore machine is then interpretable as a solution to a POMDP (Def. 5) if its machine part admits such an interpretation and its expose function emits the optimal action for the belief its state parameterises: ω(m) = π*(ψ(m)). An agent, on this proposal, is the pair of a system and such an interpretation.

Two features do the real work. First, machine states need only parameterise beliefs rather than be belief states — ψ need not be injective, so interpretations come with a built-in notion of coarse-graining, and the definition covers more than the canonical belief-state machines. Proposition 1 shows this is not a loosening in disguise: for any input that is subjectively possible under the interpretation, the parameterised distributions ψ(m) update exactly as the Bayesian belief-state update requires, so V̄*(m) := V*(ψ(m)) is an optimal value function on the machine’s own state space with optimal policy ω(m) = π*(ψ(m)). Such machines are optimal in the same sense as machines whose states are correctly-updated beliefs. Second, consistency is not correctness: whether a consistent interpretation exists depends only on the machine being interpreted, not on any property of its environment. An agent may hold a wrong model — its conclusions will then be wrong while its reasoning stays consistent — and its actions need only be optimal according to its own model, possibly suboptimal in the true environment. The authors flag this as a clear point of difference from the original Free Energy Principle literature, where the model is derived from the actual environment’s dynamics and so cannot differ from it. The hidden states and the rewards need not have any physical realisation at all; they exist only within the interpretation, and the machine never observes the rewards. Appendix C establishes that machines meeting Def. 5 exist by constructing one from the known optimal solution to Sondik’s POMDP.

The authors are careful about scope. The commitments are adopted because they permit precision, not because they are claimed to be realistic or the only reasonable choices; POMDPs are not the only possible formalisation of having a goal; they do not argue that all agents are rational or possess beliefs and goals. The framework requires exact Bayesian updating, so approximate inference — which the FEP does accommodate — falls outside it. The conclusion is offered as one worked example of the kind of agent definition sought, not as a settled general answer.

Key Ideas

Agency as consistent interpretation, not predictive advantage: ask whether the physical dynamics are consistent with an ascription of beliefs and goals, rather than whether the intentional stance out-predicts the physical stance.
An agent is a pair: a system together with an interpretation of it as a POMDP solution — agency is not an intrinsic property of the system alone.
Three conceptual commitments: systems are stochastic Moore machines; beliefs are Bayes-updated probability distributions; goals and rationality are supplied by POMDPs (expected discounted reward, optimal policy).
Interpretation map ψ : M → PH: sends internal machine states to beliefs over an interpretation-internal hidden state space; extended here with an action function α and a model kernel κ (the “influenced filtering” of Def. 3).
Definition 5: a stochastic Moore machine solves a POMDP when it has a consistent Bayesian influenced filtering interpretation and ω(m) = π*(ψ(m)) — it outputs the optimal policy’s action for the belief its state parameterises.
Parameterisation, not identity: machine states need only parameterise beliefs; ψ may be non-injective, so interpretation carries an automatic notion of coarse-graining of the internal state.
Proposition 1: for subjectively possible inputs, ψ(m) updates exactly per the Bayesian belief-state update; hence V*(ψ(m)) is an optimal value function on the machine’s state space — these machines are optimal in the same sense as belief-state machines.
Consistency ≠ correctness: existence of an interpretation depends only on the machine, not the environment. An agent can have a wrong model and act optimally only relative to it — a deliberate contrast with the FEP, where the model derives from actual environment dynamics.
Hidden states and rewards are interpretation-only: they need exist only mathematically, not physically; the machine never observes rewards. Even an output-less machine can have “actions” confined to the interpretation.
Existence is demonstrated, not assumed: Appendix C builds a qualifying stochastic Moore machine from the known optimal solution to Sondik’s POMDP.
Stated limits: exact Bayesian updating only (approximate inference excluded); POMDPs are not the only formalisation of goals; the commitments are chosen for precision rather than realism.

Connections

Conceptual Contribution

Bayesian Filtering

(page does not exist)

Autopoiesis

(page does not exist)

Generative Model

(page does not exist)

Helmholtz Decomposition

(page does not exist)

Fokker-Planck Equation

(page does not exist)

Random Dynamical System

(page does not exist)

Ergodicity

(page does not exist)

Surprisal

(page does not exist)

Variational Free Energy

(page does not exist)

Active Inference

(page does not exist)

Free Energy Principle

(page does not exist)

Markov Blanket

(page does not exist)

POMDP

(page does not exist)

Belief

In agent theory, the propositional content an agent treats as (probably) true. The B in BDI / Belief-Desire-Intention; the operand of the modal operator believes in BAN Logic and the BDI-logic family (Cohen & Levesque, Rao & Georgeff). Distinguished from knowledge (which classically requires truth) and from desire / goal. The unit of Belief Revision under the AGM postulates. In Mentalistic Semantics the meaning of an ACL message is given in terms of the belief updates it induces in sender and receiver — the locus of Singh’s critique that beliefs are unverifiable from message traces.

In this vault

Intentional Stance

Dennett’s strategy of predicting a system’s behaviour by treating it as a rational agent with beliefs, desires and goals. Wooldridge and Jennings argue it is a legitimate abstraction for sufficiently complex software, licensing mentalistic design of agents.

In this vault

A Mathematical Theory of Communication

Reference: Shannon, C. E. (1948). A Mathematical Theory of Communication. Bell System Technical Journal, 27(3), pp. 379–423 and 27(4), pp. 623–656. (Republished 1949 with additional commentary by Warren Weaver as The Mathematical Theory of Communication, University of Illinois Press.) DOI · Open access PDF (Harvard) · Internet Archive (BSTJ scan)

Summary

Shannon’s two-part 1948 paper founds information theory as a discipline. The setting is the engineering problem of communication: a source produces messages, an encoder transforms them into signals over a noisy channel, a decoder attempts to reconstruct the original. Shannon’s first move is to argue that the meaning of messages is irrelevant to the engineering problem — only their statistical structure matters. He then develops the foundational notions: entropy H = -Σ p_i log p_i as the average information content per symbol of a source; mutual information I(X;Y) = H(X) - H(X|Y) as the information one variable carries about another; channel capacity C = max I(X;Y) as the supremum of mutual information over all input distributions. The technical heart consists of two coding theorems. Source coding (noiseless coding): any source with entropy H can be losslessly compressed at rate arbitrarily close to H bits per symbol, but no lower. Channel coding (noisy-channel coding): any source with entropy below the channel capacity C can be transmitted with arbitrarily low error probability using sufficient block length, but transmission above C necessarily incurs error. Together these establish the operational meanings of entropy and capacity and bound what any communication system can achieve. The companion Mathematical Theory of Communication (1949) adds Weaver’s expository introduction, popularising the framework and inaugurating the broader engagement of philosophy and the social sciences with information theory. Shannon’s framework supplies the technical foundation for every communication system, the conceptual foundation for algorithmic information theory and the MDL principle, and a recurring background reference in agent-communication design — most explicitly in Why AI Agents Communicate In Human Language, which frames the case against natural-language inter-agent communication in Shannon-theoretic terms (lossy channel, low capacity per token, ambiguous code).

Key Ideas

Engineering decoupling from meaning: the engineering problem of communication is independent of semantic content; only the statistical structure of the source matters.
Entropy as average information: H(X) = -Σ p_i log_2 p_i measures the average uncertainty of a random variable in bits; for an i.i.d. source emitting symbols with probabilities p_i, H is the lower bound on bits-per-symbol for lossless compression.
Mutual information: I(X;Y) = H(X) - H(X|Y) = H(Y) - H(Y|X) symmetrically measures how much knowing Y reduces uncertainty about X (and vice versa).
Channel capacity: C = max_{p(x)} I(X;Y) — the maximum mutual information achievable over a memoryless channel with input distribution p(x). Capacity is the operational supremum on reliable transmission rate.
Source coding theorem: lossless compression can achieve rate arbitrarily close to H (entropy) but no lower; the practical realisation is via Huffman coding, arithmetic coding, and variants.
Noisy channel coding theorem: for any rate R < C, there exists a coding scheme achieving error probability arbitrarily close to zero with sufficient block length; for R > C, error probability is bounded away from zero. The result is non-constructive — Shannon’s proof uses random coding — but the existence guarantee is what made coding theory a field.
Continuous channels and AWGN capacity: the second part extends the discrete results to continuous channels, deriving the famous C = B log(1 + S/N) for additive-white-Gaussian-noise channels of bandwidth B and signal-to-noise ratio S/N.
Ergodic processes and Markov sources: Shannon’s analysis carefully extends from i.i.d. to ergodic and Markov sources, motivating the asymptotic equipartition property (AEP) and laying the groundwork for source coding of non-i.i.d. data.

Connections

Conceptual Contribution

Claim: The engineering problem of communication is mathematically separable from semantics; the right primitives are entropy (uncertainty per symbol of a source), mutual information (information one variable carries about another), and channel capacity (supremum of reliable transmission rate over a noisy channel). Two coding theorems establish the operational meaning of these quantities — entropy as the lossless-compression lower bound, capacity as the reliable-transmission upper bound.
Mechanism: Probabilistic model of source / channel / receiver; definition of entropy, conditional entropy, joint entropy, and mutual information; noiseless source-coding theorem (lossless compression to within ε of H); noisy channel-coding theorem (reliable transmission below C, error-bounded above C); extension to continuous channels and Gaussian noise.
Concepts introduced/used: Shannon Entropy, Shannon Information, Mutual Information, Channel Capacity, Source Coding Theorem, Noisy-Channel Coding Theorem, Asymptotic Equipartition Property.
Stance: founding paper of an entire discipline.
Relates to: Direct technical predecessor of Kolmogorov complexity / Algorithmic Information Theory (Solomonoff, Kolmogorov, Chaitin 1960s) — where Shannon measures the average information of an ensemble, AIT measures the absolute information of an individual object as the length of its shortest description; both are operationally founded on the same coding-theorem intuition. Shannon’s deliberate decoupling of the engineering problem from semantics inaugurates the running tension in agent communication between Shannon information (statistical, channel-bounded) and meaningful information (semantic, conventional, illocutionary). The agent-communication-language tradition exists precisely to address what Shannon’s framework deliberately set aside; nevertheless, the engineering bounds Shannon establishes constrain any agent communication channel, including LLM-mediated natural-language exchange. Why AI Agents Communicate In Human Language makes this explicit: natural language as inter-agent code has low channel capacity per token, high error probability under lossy LLM compression, and ambiguous decoding — Shannon-theoretic objections that motivate the case for structured ACLs. Conceptually adjacent to Chomsky 1956, which addresses the generative-grammatical structure of language as a parallel layer to Shannon’s statistical structure; together they delimit the design space of any communication system.

Tags

#information-theory #shannon #entropy #channel-capacity #foundations #communication

Self-Organisation

The emergence of global structure in a system from local, decentralised interactions without a central controller; a core design principle for scalable and resilient MAS and overlay networks.

In this vault

Homeostasis

(page does not exist)

d-Separation

Pearl’s graphical criterion for conditional independence in a Causal DAG: a path is blocked by a conditioning set if it contains a non-collider in the set or a collider with no descendant in the set.

In this vault

Conditional Independence

(page does not exist)

Solenoidal Flow

(page does not exist)

Variational Inference

(page does not exist)