Skip to content
Science, DecodedContext Jamming

Module 7 · suggested week 7

The Physics–Biology–AI Connection Lab

Recognise common structures without manufacturing false equivalences.

~3 focused hoursBuilds on modules 2, 3, 4, 5, 6 (advisory)
0 of 8 sections read

What you will be able to do

Practise grading cross-disciplinary connections (analogy, shared structure, shared mechanism, predictive transfer) on real case studies: scaling, entropy, evolution and optimisation, networks, feedback, emergence, and AdS/CFT. Follow Jared Kaplan’s documented path from holography to scaling laws as a study in transferable habits.

The grading ladder

Every comparison in this module gets a grade:

  • Level 1 · Analogy. The two things resemble each other. Useful for generating questions; not evidence.
  • Level 2 · Shared mathematical structure. The same equations or formal objects describe both. Substantive: tools transfer. But identical mathematics can describe unrelated causes.
  • Level 3a · Shared mechanism. The same causal process operates in both.
  • Level 3b · Predictive transfer. Knowledge from one field yields a specific prediction in the other that survives testing. It is possible to have 3b without 3a: a formula can transfer and work for different underlying reasons.

You will grade each comparison yourself before reading the verdict. Keep the Connection Analyzer open in another tab if you want to write your reasoning down.

Case 1 · Biological scaling and neural scaling

Biology. Across many species, metabolic rate BB scales with body mass MM roughly as B∝M3/4B \propto M^{3/4} (Kleiber’s law). West, Brown and Enquist (1997) proposed a mechanism: space-filling, fractal-like distribution networks (blood vessels) that minimise transport costs predict the 3/4 exponent.

AI. Kaplan et al. (2020) found that language-model test loss falls as a power law in parameters NN, data DD and compute CC over several orders of magnitude.

Both are power laws relating a size variable to a performance or cost variable, with exponents that matter. Grade it before reading on.

Kleiber’s law vs. a neural scaling lawEmpirical regularity
B∝M3/4vs.L(N)≈(NcN)αNB \propto M^{3/4} \qquad\text{vs.}\qquad L(N) \approx \left(\frac{N_c}{N}\right)^{\alpha_N}

Left: metabolic rate grows with mass to the 3/4 power. Right: loss falls with parameter count to a small negative power (αN\alpha_N was roughly 0.076 in Kaplan et al.’s fits). NcN_c is a fitted constant.

Does not say: The biological exponent and its proposed explanation are both debated; the neural exponents depend on architecture, data and tokenisation.

Inspect symbol by symbol →

Empirical regularity

Verdict: Level 2 at most. Same mathematical form and the same research habit (fit an exponent, then look for the network or geometry that explains it). The proposed mechanisms are different: vascular network geometry vs. resolving a data manifold. No result transfers a prediction from one to the other.

Go deeper: A real mechanistic proposal for neural scaling

Sharma and Kaplan (2020) proposed that the scaling exponent is set by the intrinsic dimension dd of the data manifold, roughly α≈4/d\alpha \approx 4/d for their setting. Bahri, Dyer, Kaplan, Lee and Sharma (2021) extended this into four regimes (variance-limited and resolution-limited, for both model size and data size). This is a Level 3a candidate within ML: it names a mechanism and predicts exponents from measurable quantities. Its support is partial and setting-dependent. The site’s Scaling Regimes explainer walks through it.

Case 2 · Statistical mechanics and information theory

Gibbs entropy vs. Shannon entropyEstablished
S=−kB∑ipiln⁡piH=−∑ipilog⁡2piS = -k_B \sum_i p_i \ln p_i \qquad H = -\sum_i p_i \log_2 p_i

Identical form. Left: physical entropy of a probability distribution over microstates, in units of energy per temperature. Right: average information (in bits) of a probability distribution over messages.

Inspect symbol by symbol →

Shannon noticed the formal identity in 1948. Later, E. T. Jaynes argued that statistical mechanics can be derived as inference: the Boltzmann distribution is the maximum-entropy distribution consistent with a known average energy. On that reading the connection is deeper than notation. The same principle (maximise uncertainty subject to what you know) produces both.

The physical link is also concrete in one place: Landauer’s principle says erasing a bit of information in a physical device dissipates at least kBTln⁡2k_B T \ln 2 of heat. That has been tested in laboratory experiments.

Established

Verdict: Level 2, with a genuine Level 3 thread. The mathematics is identical, and the maximum-entropy framework makes it more than coincidence. Landauer’s principle ties information processing to thermodynamics in physical hardware. But "the entropy of a language model’s next-token distribution" is not a thermodynamic quantity of the GPU. Using one to reason about the other needs an explicit physical argument.

Loading interactive…

Shape a distribution and watch HH change. The same calculation, with physical units and a Boltzmann constant attached, would be a Gibbs entropy. That is exactly why the formulas match and exactly why the interpretations need to be kept apart.

Case 3 · Evolution and optimisation

Biologists talk about fitness landscapes; ML researchers talk about loss landscapes. Both picture a population or a parameter vector moving through a high-dimensional space toward "better" regions. Evolutionary algorithms explicitly borrow mutation, selection and recombination.

But natural selection and gradient descent work very differently:

Selection is not gradient descent

Natural selectionGradient descent
What movesA population of varied individualsOne parameter vector (or a few replicas)
Direction informationNone. Variation is undirected; selection filters after the factExplicit. The gradient is computed and followed
ObjectiveNo fixed objective; "fitness" depends on environment, which changes and includes other organismsA fixed, specified loss function (per training stage)
MemoryEncoded in genomes across generationsEncoded in weights (plus optimiser state)
Credit assignmentWhole organism lives or diesEach parameter gets its own partial derivative
Loading interactive…

The same 2D landscape, two search processes. The population finds high ground by mutation and selection without ever computing a slope; the gradient follower uses the local slope directly. Notice how differently they handle multiple peaks.

Analogy

Verdict: Level 1 for "training is evolution"; Level 2 for evolutionary algorithms. Selection and gradient descent are both optimisation-like processes, and some mathematics (for example, under certain assumptions selection approximately climbs a fitness gradient on average) connects them. But calling neural-network training "evolution" erases the crucial difference: gradients give per-parameter directional information that selection never has.

Case 4 · Networks, feedback, and emergence

Networks. Gene regulatory networks, neural circuits and artificial neural networks are all graphs. Network science gives shared tools: degree distributions, motifs, modularity. Alon’s work on gene networks found recurring "network motifs" (small wiring patterns such as feed-forward loops) and studied their dynamics. Whether similar motifs in an artificial network compute the same thing is an open empirical question in each case.

Feedback and agents. An agentic AI loop (observe → plan → act → observe) is a feedback controller. Control theory’s lessons about gain, delay and stability apply directly to the loop’s structure, which is Level 2. They do not tell you whether the LLM inside the loop reasons well.

Emergence. Hopfield (1982) explicitly titled his paper around "emergent collective computational abilities": memories stored as low-energy states of an Ising-like network. That is a Level 2 bridge built on purpose: physics mathematics repurposed as a computational model. Hopfield and Hinton received the 2024 Nobel Prize in Physics for foundational work connecting physics and machine learning.

Established

The Hopfield network’s energy function has the same form as an Ising model’s energy. Memory retrieval corresponds to descending to a local energy minimum. This is a deliberate mathematical mapping, not a discovered coincidence.

Source: Hopfield 1982, PNAS

Go deeper: Energy minimisation and ML optimisation

Physics often describes equilibrium as minimising energy, or free energy F=E−TSF = E - TS at finite temperature. ML often describes training as minimising loss. Several ML methods are built on this explicitly: energy-based models, Boltzmann machines, and the "temperature" in sampling. These are Level 2 by construction. The claim "the brain minimises free energy" (the free-energy principle) is a broader theoretical proposal whose testability is actively debated, so grade it separately from the ML usage.

The Kaplan thread: from holography to scaling laws

Jared Kaplan’s documented path makes a good case study in which habits travel between fields. The facts below come from his Johns Hopkins faculty page, arXiv records and the site’s Founder File on Kaplan.

  • B.S. in physics and mathematics, Stanford.
  • Ph.D. in physics, Harvard (2009), thesis Aspects of Holography, advised by Nima Arkani-Hamed.
  • Postdoctoral fellow at SLAC and Stanford; then faculty in Physics and Astronomy at Johns Hopkins.
  • His JHU page lists research in quantum gravity, conformal field theory and machine learning, including using CFT to learn about quantum gravity through AdS/CFT, and collaboration on scaling laws for neural models and on GPT-3. It notes he is a co-founder of Anthropic.
  • First author of Scaling Laws for Neural Language Models (2020); co-author of the data-manifold scaling paper with Utkarsh Sharma (2020) and Explaining Neural Scaling Laws (2021).

His faculty page also carries a methodological credo, paraphrased: genuinely new ideas should lead to new equations, and without precise results it is very hard to avoid fooling yourself.

Physics habits, visible in the scaling papers

HabitIn physicsVisible move in the ML papers
Dimensional analysisCheck units; build dimensionless ratiosLoss expressed via ratios like Nc/NN_c/N; compute measured in consistent units (PF-days)
Scaling behaviourAsk how quantities change with sizeVary N, D, C over orders of magnitude instead of tuning one model
Simplified modelsIsing model, harmonic oscillatorRandom-feature and teacher–student models in Bahri et al. 2021
Universal relationshipsCritical exponents independent of microscopic detailFinding that width/depth details matter little within a wide range
Statistical thinkingEnsembles, averages, fluctuationsDistinguishing variance-limited from resolution-limited regimes
Governing variablesFind the few parameters that control behaviourCollapse performance onto N, D, C, with intrinsic data dimension as a candidate fourth
Evaluating regularitiesIs a law fundamental or effective?Treat power laws as empirical, then propose a mechanism (manifold dimension) that predicts the exponent

Practise reading the result itself in the Kaplan 2020 paper guide.

Case 5 · AdS/CFT and Constitutional AI: an instructive near-miss

AdS/CFT. In 1997 Juan Maldacena conjectured that certain theories of quantum gravity in anti-de Sitter space (the "bulk") are exactly equivalent to certain conformal field theories without gravity living on its boundary. Two complete descriptions of one physical system: every bulk quantity has a boundary counterpart. It is a precisely stated duality in specific settings, supported by an enormous body of calculations, but not proven in general.

Constitutional AI. Bai et al. (2022) trained a harmless assistant using a written list of principles. In a supervised phase the model critiques and revises its own outputs against the principles. In an RL phase an AI model judges which of two responses better follows them, those preferences train a preference model, and that preference model serves as the reward (RLAIF).

The analogy. A short boundary document shapes the behaviour of a vast interior (the network’s weights), just as boundary data in AdS/CFT encode the bulk. It is evocative. Here is where it holds and where it breaks.

Where the analogy works, and where it breaks

DimensionAdS/CFTConstitutional AIDoes the analogy hold?
Kind of claimA conjectured exact mathematical equivalence between two theoriesA training method and its empirical resultsNo. An equivalence vs. a procedure
"Boundary" and "interior"Literal geometry: boundary of a spacetimeMetaphor: a short text vs. many parametersLoosely. Only as a picture
InformationBoundary theory contains all bulk information; the map is invertible in principleThe constitution does not determine the weights; pre-training data and optimisation do most of the workNo. The constitution underdetermines behaviour
DictionaryExplicit entries (fields ↔ operators, bulk mass ↔ scaling dimension)No formal map from principles to weightsNo
Evidence typeMathematical consistency checks, matched computationsHuman and AI evaluations of harmlessness and helpfulnessDifferent kinds of evidence
Shared themeA compact description governing a large systemA compact description steering a large systemYes, at the level of a research question
Analogy

Verdict: Level 1. AdS/CFT and Constitutional AI are not known to be mathematically equivalent or to share a mechanism. The analogy can prompt good questions, such as "how much of a model’s behaviour can a short specification determine?" or "is there a dictionary between principles and internal features?" But it is not evidence for any answer.

The limits: holography, representations, governance

Three more bridges are often built through the holography metaphor:

  • Holography ↔ model representations. "A model compresses the world onto a lower-dimensional surface, like holography." Low-dimensional structure in learned representations is real and measurable (see the flagship exercise). Calling it holographic adds no prediction unless a precise bulk/boundary dictionary is proposed. Level 1.
  • Holography ↔ AI governance. "Rules at the boundary of an organisation govern its interior." This is a management metaphor. It carries no physics.
  • Mathematical abstraction ↔ physical implementation. The same abstract object (a graph, a probability distribution, an optimisation problem) can be implemented by neurons, transistors or ecosystems. Shared abstraction licenses shared tools, not shared nature. A thermostat and a hormone loop are both negative-feedback controllers; one is not secretly the other.
Speculation

Claims of the form "intelligence is holographic" or "LLMs are a boundary theory of human knowledge" are, as of this writing, speculation: no formal correspondence, no distinguishing prediction, no test.

Connections, with their levels

PhysicsLevel 2 · Shared math

Hopfield networks ↔ Ising model

Energy function of the same form; memory retrieval as energy descent.

Why this level: Built deliberately on shared mathematics. It does not show that brains store memories this way.

PhysicsLevel 3 · Shared mechanism

Gibbs ↔ Shannon entropy

Identical formula; maximum-entropy reasoning links them; Landauer’s principle ties information erasure to heat.

Why this level: Graded 3a only for the Landauer link in physical computing hardware. The formula match alone is Level 2.

BiologyLevel 1 · Analogy

Natural selection ↔ gradient descent

Both search high-dimensional spaces for better solutions.

Why this level: Selection lacks per-parameter directional information and a fixed objective. Evolutionary algorithms deliberately borrow the analogy.

AI / MLLevel 1 · Analogy

AdS/CFT ↔ Constitutional AI

A compact "boundary" description governing a large "interior".

Why this level: No mathematical equivalence, no dictionary, no shared mechanism. Useful only as a source of testable questions.

Skeptic’s corner: Grading any connection

Before you publish or repeat a cross-disciplinary connection, write down its level and the single piece of evidence that would raise it one level.

  • Are the two quantities defined the same way, with the same units and the same measurement?
  • Is the shared equation doing work, or just the shared word ("entropy", "temperature", "emergence", "boundary")?
  • Does the connection yield a prediction in field B that you would not have made from field B alone?
  • Has anyone tested that prediction, and could it have failed?
  • Would the claim survive if you replaced the evocative term with its definition?

Watch & explore

ProgramLewis-Sigler Institute, Princeton University

Integrated Science Curriculum

A design reference for this curriculum: physics, chemistry, molecular biology and computer science taught as one quantitative course.

Watch for: The premise that shared quantitative tools, not departmental boundaries, organise the science.

Verified: Page loaded in browser, 2026-10-30

ProgramNorthwestern University

Integrated Science Program

A design reference: an undergraduate program combining physics, biology, chemistry, mathematics, statistics and computation.

Watch for: How the program sequences math alongside the sciences rather than before them, as this curriculum does.

Verified: HTTP 200 + page content checked, 2026-10-30

PaperElhage et al. · Anthropic (transformer-circuits.pub)

Toy Models of Superposition

An explicitly physics-flavoured interpretability paper: phase diagrams, geometry and phase changes in tiny models.

Watch for: How the authors label what holds in toy models versus what they conjecture for large models.

Verified: HTTP 200 + page content checked, 2026-10-30

PaperTempleton et al. · Anthropic (transformer-circuits.pub)

Scaling Monosemanticity

Sparse autoencoders applied to a production model, with scaling laws for the dictionaries themselves.

Watch for: The limitations section. It is a model of honest scoping.

Verified: HTTP 200 + page content checked, 2026-10-30

Video23 min3Blue1Brown

How might LLMs store facts (ch. 7)

Bridges to interpretability: directions in high-dimensional space as features, and why superposition lets a model pack in more features than it has dimensions.

Watch for: The explicit hedges. The video separates what interpretability research has shown from the illustrative toy story it tells.

Verified: YouTube oEmbed title+channel check, 2026-10-30

CourseMelanie Mitchell · Santa Fe Institute Complexity Explorer

Introduction to Complexity

No prerequisites, and it covers dynamics, chaos, fractals, information, self-organisation, agent-based models and networks, the same toolkit as Module 5.

Watch for: The units on networks and scaling. Notice how often Mitchell separates "this is a model" from "this is how nature works".

Verified: HTTP 200 + page content checked, 2026-10-30

CourseDavid Feldman · Santa Fe Institute Complexity Explorer

Fractals and Scaling

The most careful free treatment of power laws. It includes how to estimate an exponent and why straight lines on log-log plots are easy to over-read.

Watch for: The sections on fitting power laws. They are the antidote to "it is a power law, therefore it is universal".

Verified: HTTP 200 + page content checked, 2026-10-30

Free bookSimon J. D. Prince

Understanding Deep Learning

Free PDF plus notebooks. The clearest modern bridge from equations to architectures, including transformers.

Watch for: Chapters on loss functions and on transformers. The notation table at the front is worth bookmarking.

Verified: HTTP 200 + page content checked, 2026-10-30

Research & references

Reflect

There are no right answers to check against. These questions are for thinking on the page, and your answers go to your notebook.

Grade one connection you have personally found exciting (in your Context Jamming work or reading) using the four levels. What evidence would raise it one level?

Not saved yetAll reflections →

Rewrite the AdS/CFT ↔ Constitutional AI analogy as a testable question that does not mention physics at all.

Not saved yetAll reflections →

Which of Kaplan’s transferable habits would most improve how you evaluate AI go-to-market claims?

Not saved yetAll reflections →

What question would you ask West, Brown and Enquist about whether their mechanism could say anything about neural networks?

Not saved yetAll reflections →