Every Law on the Rack

The final pile and the total number of topplings do not depend on the order the grains fall in. That commutativity turns the recurrent states into an abelian group — whose identity element is itself a striking fractal.

Anything above the limit folds back into (−f_s/2, f_s/2]. Divide by N and you get the spin you actually perceive — this is the line the instrument computes each frame.

τ too small and the coordinates are near-identical — the cloud collapses onto the diagonal. τ too large and the fold tangles. The usable window is near the autocorrelation’s first zero (or the first minimum of mutual information): decorrelated, not yet folded.

How to get ∇L cheaply: the chain rule, run backwards. The error at the output is propagated layer by layer, and each weight’s gradient is its incoming activation times the error flowing back through it.

Why it’s optimal: for Gaussians, posterior ∝ prior × likelihood is again Gaussian, and its mean is precisely the Kalman update. The filter is Bayes’ rule, closed-form, once per tick.

Below T_c the thermal density saturates, so every further-cooled atom is forced into the ground state. That exact curve is what the inset dot rides.

In a harmonic trap the critical point follows the atom count and the trap stiffness — more atoms condense warmer. Slide N and the inset’s T_c line moves.

Condensation isn’t set by temperature alone but by phase-space density: when the de Broglie wave is as big as the spacing between atoms, nλ³ hits ζ(3/2).

The payoff: thousands of atoms share a single wavefunction — one amplitude, one phase. A quantum state grown to a size you can photograph.

Bell’s bound in testable form: four correlators at four angles. Every local-hidden-variable theory obeys S ≤ 2 — so one measured S above 2 rules them all out at once.

Quantum mechanics breaks the classical wall — but not infinitely. The most it reaches is 2√2, hit exactly at the optimal angles. Strange, yet still lawful.

Two particles, one state — neither has a spin of its own, yet along any shared axis they always come out opposite. The whole is defined exactly where the parts are not.

The average product of the two ±1 outcomes, fixed only by the angle between the detectors. It bows past every straight line a local model can draw — and that gap is the whole effect.

The value of a state is the best action’s immediate reward plus the discounted value of wherever it lands you. Optimal play is exactly the solution of this self-referential equation — the present worth of the whole future, folded into one line.

The one rule. Nudge the estimate toward the reward you just got plus the best value you now see ahead; the bracket is the TD error — the surprise. Learn the future from a better guess of the future, with no model of the world at all. This single line drives The Descent’s deep-RL descendants.

How good it is to take action a in state s and then play greedily forever after — the expected discounted reward. Learn this table and the policy is free: in every state, pick the action with the highest Q.

The dark disc is bigger than the horizon itself: any ray aimed inside the critical impact parameter b_crit is swallowed. Lensing magnifies the r_s horizon into a √27 ≈ 5.2 r_s silhouette — the ring the Event Horizon Telescope photographed in 2019.

Three steering urges — match their heading, move toward them, but keep your distance — summed with weights. That is the whole brain; nothing in it knows the flock exists.

In thermal equilibrium a state of energy E is occupied with weight e^−E/kT. Temperature sets how readily the system pays energy to leave a comfortable valley — the physics annealing borrows and aims.

The cloud is the square of the wave. Squaring discards the phase — which is exactly the half this instrument paints back in as colour.

Einstein 1905 tied this walk to Avogadro’s number — the jiggle of a pollen grain as proof that matter is atoms. Five years earlier Bachelier had modelled prices as the same walk: the seed of quantitative finance and every backtest.

The same eight bits sort into four behaviours — uniform, periodic, chaotic, complex. Rule 110 sits in the last and is Turing-complete: a universal computer hiding in three bits.

Each cell sees only itself and its two neighbours, and a single local function decides its next state. No cell knows the whole world — all behaviour is local.

Three binary inputs make eight possible neighbourhoods, and a rule just picks an output bit for each — so the entire space of laws is countable and small.

Standardise the sum of any finite-variance step law and it converges to the same standard Gaussian. The bell is the universal attractor of sums — the reason it is everywhere.

The bits per use you can send with vanishing error. Noise eats capacity; at p = ½ the channel carries nothing at all — input and output share no information.

A measure-zero set of exact periodic orbits survives the chaos — Euler’s collinear line, Lagrange’s equilateral triangle (the origin of the L-points), and the figure-eight.

Integrated by velocity-Verlet (leapfrog) — symplectic, so energy stays bounded over thousands of periods. The drift readout proves the orbits are the law’s, not the solver’s.

Temperature falls a little each sweep. Cool slowly (α → 1, anneal) and the search settles in the global minimum; cool fast (quench) and it freezes wherever it happens to be — a defect.

The share of the grid that cooperates — the population’s order parameter, exactly as magnetization is for The Threshold. On the spatial dilemma it settles near 0.318 across a band of b: neither all-C nor all-D, but a living mixture.

Matter has a wavelength set by its momentum — the reason a particle can interfere at all. Heavier or faster ⇒ shorter λ ⇒ finer, harder-to-see fringes.

Cold atoms have longermatter waves. Cool far enough and each atom’s wave grows until it overlaps its neighbours — the gas stops behaving like particles.

Stack a signal against delayed copies of itself to build an m-dimensional vector. As t runs, the point v(t) traces a curve — and that curve is a faithful copy of the hidden attractor you never measured directly.

Forget absolute density; what matters is the contrast — how much denser than average each patch is. The early universe was nearly smooth, δ ~ 10⁻⁵ everywhere. Gravity does the rest.

The same descent, pushed too hard, is the route to chaos. Raise η and the step overshoots the minimum, then overshoots back — a period-2 oscillation that doubles into divergence, exactly the bifurcation The Cascade draws.

Melt the data: drift each sample gently toward the origin while injecting Gaussian noise, step after step, until after enough time every trace of structure is gone and the cloud is indistinguishable standard noise. It is The Walk’s Brownian motion with a leash.

Run time backward and the same diffusion becomes generative: the score term steers the noise uphill in probability, condensing formless static back into samples. Anderson proved a reversed diffusion is itself a diffusion — the theorem the whole field stands on.

The gradient of the log-density — at every point, the direction toward where data is denser. A real model learns it by denoising (gradient descent — The Descent); here we use the exact score of a known target, so the reverse flow is honest with nothing trained.

Drop the noise term and a plain ODE carries the same changing density: one fixed noise seed maps to one sample along a smooth path — the streamlines you watch the particles ride here. Same marginals, no randomness.

Diffusion on the grid is a weighted blur of the eight neighbours minus the centre — the only spatial coupling in the whole system.

A solid fractal has no formula for “distance to the surface”, but the escape-time potential gives a safe lower bound. The ray leaps by that bound each step — far away it strides, near the surface it creeps — so the whole bulb resolves in a few dozen steps per pixel.

Release one particle far away. It random-walks — Brownian, undirected — until it touches the cluster, then freezes there forever. Repeat a million times. A seed becomes a branching tree.

A bump that pokes out intercepts more wandering walkers, so it grows faster and pokes out more — a runaway that sharpens tips and starves the bays between them. That instability is why the branches never fill in, and why they look the same at every magnification.

Straight from the Lagrangian L = T − V. No approximation, no randomness — every pendulum obeys this to the letter (Δ = θ₁ − θ₂).

The two arms are nonlinearly coupled — the source of the unpredictability. We integrate both with RK4 so energy doesn’t drift.

Matter tells spacetime how to curve; the curvature tells matter (and light) how to move. Gravity isn’t a force in the picture at all.

Ω is the number of microstates that look like the current macrostate. The corner has vanishingly few; "spread out" has almost all of them — so that is where the gas goes. Engraved on Boltzmann’s tombstone.

Surprise, in bits — the average doubt in one channel use. Maximal (one full bit) when p = ½, the channel a pure coin flip; zero when the outcome is certain. This is the thing a good code never wastes.

Rolf Landauer’s 1961 result: erasing one bit of information in a thermal environment costs at least k_BT ln 2 joules — irreversibly dissipated as heat. This is the bridge between information theory and thermodynamics: information is not just abstract, it is physical.

The same sum The Arrow carves as heat (S = k·ln Ω): there it counts microstates and points time forward, here it counts bits and bounds what a channel can carry. Entropy and information are one measure, read in two worlds.

What the instrument plots: coarse-grain the box into cells, count the occupancy pᵢ, sum. It is maximal at a uniform spread — the Gibbs/Shannon form of the same quantity.

The deep identity: an outbreak is the giant connected component of “occupied” edges, each present with probability T. Vaccination is site percolation; transmissibility is bond percolation. The epidemic threshold is a percolation threshold.

Most of the time take the best action you know; a fraction ε of the time gamble on a random one — because the only way to find a better path is to risk a worse one. Too little ε and the agent locks onto the first route it finds; too much and it never commits.

Inside a wall too tall (E < V₀) the wave doesn’t oscillate — it decays. Not to zero, just smaller: thin enough, and something survives to the far side.

A fast excitable variable v with a cubic nullcline, coupled to a slow recovery w. A small kick decays; a kick past threshold fires a full spike, then a refractory pause — the engine of every wave here. (Simulated via Barkley’s numerically-robust cousin.)

One stable rest state and a threshold. Below it perturbations die; above it the response is all-or-none and identical however hard you pushed, followed by a recovery window in which it cannot fire again. Threshold plus refractoriness is the whole secret.

Diffusion D and reaction rate r set how fast an excitation front marches — faster coupling, faster wave. Multiply by the recovery period T and you get the wavelength: the spacing between crests in a train, or the arms of a spiral.

A curved wavefront travels slower than a flat one by an amount set by its curvature κ. A broken end lags, the front pivots about the gap, and the lag winds it into a spiral that turns forever about its tip — why spirals are inevitable, not accidental.

Fix c and iterate every starting point instead and you get its Julia set. It is one connected piece exactly when c lies in M — otherwise it shatters into a Cantor dust. M is the index of them all.

An N-spoke wheel looks identical every 1/Nturn, so the rate that matters isn’t its spin — it’s how often it returns to an identical pose: N × the spin.

The doubling intervals shrink by a fixed ratio that converges to δ ≈ 4.6692 — and Feigenbaum found the samenumber for any smooth one-hump map. The route into chaos is universal; it doesn’t care what the map is.

On the real axis z² + c is the logistic map in disguise: the period-1 cardioid, the period-2 disc, then 4, 8, … bulbs accumulating at Feigenbaum — the same cascade The Cascade (INST·02) walks, here as a map.

Each agent reads only the neighbours inside a radius r — never the whole flock. Everything below is computed over that handful, and that locality is the entire point.

One number for "how much one mind": 0 when headings are random, 1 when unanimous. Raise the noise and φ collapses past a critical η_c — order is a phase, not a dial.

Fourier claimed something outrageous in 1822: any periodic signal — even one with corners and jumps — is a sum of smooth sine and cosine waves at integer multiples of one fundamental frequency. The harmonics slider adds these terms one by one.

Euler’s formula turns each harmonic into a rotating vector of radius |cₙ| spinning at speed n. Stacked tip-to-tip they are the epicycle chain on the left; the pen’s height is the signal.

Run it backwards: the discrete Fourier transform reads the amplitude of each harmonic out of the samples — the spectrum bars. The same operation lives inside MP3, JPEG and every spectrum analyser.

The whole signal folded onto the frequency axis: perfect pitch resolution, and zero sense of when. The wavelet trades a sliver of this for all of the missing time.

Any shape is a sum of pure modes — a Fourier sine series. A triangular pluck at position p has these exact weights, so a centre pluck (p=½) cancels every even harmonic.

Count how many pairs of reconstructed points fall within distance r; it grows as a power of r whose exponent is the attractor’s fractal dimension. The deep payoff: an invariant of a system you only ever sampled through one wire — kin to The Set and The Dendrite.

The number of particles within radius R scales as a power of R, and the exponent D ≈ 1.71 is fractional — denser than a curve, sparser than the plane. The cluster is mostly empty space, at every scale.

How far apart the bright bands sit. Wider wavelength or closer slits ⇒ wider fringes — the two spatial knobs on the panel move exactly this.

For a fat or soft wall, the leak is set by the area of forbidden region the wave must cross — Gamow’s factor, the same integral that dates a rock by its alpha decay.

The price earns a steady drift μ and is kicked by Brownian noise σ, both scaled by the price itself— so returns, not absolute moves, are what’s random. The multiplicative twin of The Walk’s additive diffusion.

The skew made precise: the mean rides above the median by e^σ²t/2. A symmetric shock to returns is an asymmetric shock to price — upside unbounded, downside floored at zero.

Itô’s lemma integrates the SDE exactly: log-price is a drifting Gaussian, so the price is log-normal. This is the increment each sample path multiplies by — no discretisation error.

At a jump, no finite sum of smooth waves ever closes it — a ripple overshoots the edge and, as you add harmonics, only narrows, never flattening. Its height homes in on a fixed ≈ 8.95% of the jump: the square hits it almost at once, the sawtooth climbs toward it from below.

M is the link matrix (a column per node, its 1s split evenly down its out-links). The teleport term — jump to a random node with probability 1−d — makes G positive and connected, so a single, well-defined rank is guaranteed to exist.

The whole of learning. The gradient ∇L points uphill, so step the opposite way, scaled by the learning rate η. Repeat. There is no cleverer secret underneath modern AI than this line.

B autocatalyses through the AB² term — it eats A to make more of itself; feed F tops up A, kill k removes B.

The velocity distribution relaxes to Maxwell–Boltzmann (the line in the histogram), and H falls monotonically: the H-theorem. The temperature never changes — only the shape does.

Codewords sit at least three flips apart, so any single error still lands nearest its original — sphere-packing in bit-space. A 3-bit syndrome names the flipped position outright. Hamming, 1950.

The walker-arrival probability obeys Laplace’s equation — the same discrete Laplacian The Skin diffuses with — and the cluster grows fastest where that field is steepest. Drift biases the walkers and the tree leans into the wind.

The walker density obeys the heat equation; its point-source solution is the spreading Gaussian — the silver curve, of width σ = √(2Dt). One blind walker becomes a smooth, deterministic law.

The curve where a mode never moves. Sand bounced off the violently vibrating antinodes drifts until it lands on these still lines and stays — so the silence, not the sound, is what you see. Chladni’s 1787 figures are these zero sets made visible.

Count the modes below frequency k: they grow as the drum’s area times k², with a correction in its perimeter. So the spectrum betrays the area and the edge exactly — you can hear how big the drum is. Just not, Kac asked, its shape; in 1992 the answer came back: no.

A drumhead’s standing waves are the eigenfunctions of the Laplacian on its domain Ω, pinned to zero at the rim. Each solution φ is a pure mode shape; its eigenvalue k² fixes the tone. The shape of Ω chooses the whole ladder of modes — that is the question.

On a rectangle the modes are products of sines, frequencies following √((m/a)² + (n/b)²); on a disk they become Bessel functions J_l with circular and radial nodes. The sand settles wherever φ = 0.

Immunise a fraction p and you thin the network of usable paths. Past p_c the infected component can no longer span the graph and the outbreak stops — even though a majority remain susceptible.

A decision, in closed form: the chance of finishing above a target K is Φ(d₂). The fraction of sample endpoints above the line converges to it — the histogram checking the formula.

Replace the forward sum with a max and keep a back-pointer: δ carries the score of the best path reaching each state, and the trace-back yields the single most-likely sequence of regimes — one global decode, not a string of per-step guesses.

A hidden chain of states you never see — transitions a — each state emitting an observation x through its own distribution b. Three things define it: the start π, the transition matrix, the emissions. Everything else is inference.

Sweep forward accumulating α (the evidence up to t) and backward accumulating β (the evidence after it); their product, normalized, is the probability of each hidden state at every step — the soft regime bands painted under the price.

When the transitions and emissions are unknown, Expectation–Maximization re-estimates them from the very posteriors forward–backward computes, alternating until they stop moving. The chain learns its own parameters — the unsupervised cousin of The Lens’s given model.

Any vector field splits (Helmholtz) into a divergence-free flow plus the gradient of a scalar. We solve a Poisson equation ∇²p = ∇·u* for that scalar and subtract its gradient, leaving a mass-conserving field. This is the projection step every frame.

Carve each pattern ξ^μ into the wiring: neurons that agree in a memory get a positive link, those that disagree a negative one. Memory is a property of the connections, never one address.

The Ising energy of The Threshold, but with learned couplings w_ij. Every neuron flip can only lower it, so the state slides downhill and must stop — in a memory.

Store more than ≈0.138N patterns into N neurons and the basins overlap and collapse into spurious blends — the net forgets everything at once. The spin-glass price of a distributed memory.

Show a corrupted cue, then let each neuron align with the majority vote of the rest. The state rolls down E into the nearest stored pattern — content-addressable memory: the cue is the address.

No fitting, no simulation — Onsager solved it on paper. Above it, noise wins; below it, order.

Each spin σ = ±1 only wants to match its four neighbours (coupling J > 0); the field h tilts the whole sheet one way.

Temperature is the only referee: cheap moves are always taken, costly ones only a fraction e^−ΔE/kT of the time. Run it and the sheet is a draw from the thermal ensemble.

The magnetisation leaves zero with a vertical tangent at T_c — that exact curve is what the inset dot rides.

At T_c the correlation length blows up and the lattice looks the same at every zoom. The kicker: these exponents are universal — the very same numbers describe water’s critical point and a ferromagnet.

The heart of it: the gain is the prediction’s share of the total uncertainty. Confident prediction (small P⁻) or noisy sensor (large R) → K small, trust the model. Loose model (large Q) → K → 1, trust the blip.

The model pushes the belief forward — here a constant-velocity guess — and inflates the covariance by the process noise Q. With no correction this step alone is a forecast: the ellipse only grows.

How wrong the prediction was, and how much that surprise could be noise. S is the innovation’s covariance — the prediction’s uncertainty plus the sensor’s.

The new estimate is the prediction nudged toward the blip by K of the innovation, and the covariance shrinks — the ellipse closing. Information only ever sharpens the belief.

Run predict without correct, over and over, and P grows without bound: the covariance ellipse becomes a forecast cone. The Lens, blinded, is The Oracle.

The attractor has a fractal (Hausdorff) dimension of ≈ 2.06 — more than a surface but less than a volume. Trajectories are confined to this set forever, yet are locally unstable in every direction. This is what "strange" means: attracting yet chaotic.

The exact single-soliton solution to KdV. Amplitude = c/2, speed = c — taller solitons travel faster. The width narrows as amplitude rises, so a soliton’s energy is concentrated into ever-tighter pulses. When two solitons meet, they pass through each other, emerging with the same shape — only their positions shift (the phase shift).

After two KdV solitons collide and separate, each soliton is displaced from where it would have been without the collision. This phase shiftis the only trace of the interaction — their shapes are entirely preserved. Zabusky and Kruskal named these objects “solitons” in 1965, because they behave like particles.

The KdV equation governs shallow water waves, plasma waves, and ion-acoustic waves. The nonlinear term 6u∂u/∂x steepens tall waves (making them faster); the dispersive term ∂³u/∂x³ spreads them out. Their balance produces the soliton: a stable, shape-preserving pulse that travels at constant speed forever.

The rate at which thermal fluctuations knock a particle over a potential barrier ΔU, with D = σ²/2 the noise diffusion. In the threshold model of stochastic resonance, this sets how often the noisy signal crosses the threshold — and therefore the output firing rate that tracks the input signal.

Above threshold the coherence rises continuously from zero — a second-order phase transition. Exact for a Lorentzian spread; the silver curve the live point tracks.

The ignition point. Widen the frequency spread g and you raise the bar; sharpen it and the chorus locks for almost any nudge. The blue line on the bifurcation inset.

Only oscillators slow enough to be captured join the cluster; |ωᵢ| > Kr keep drifting around the rim. The locked fraction is on the readout — and a bimodal spread can refuse to pick one rhythm at all.

Because the coupling is global, every oscillator feels a single pull toward the mean phase ψ, of strength Kr. The pull grows with the order it has already created — the feedback that makes the transition sharp.

Each oscillator runs at its own frequency ωᵢ and is pulled toward every other by the coupling K. With global coupling this is the whole model — Kuramoto’s solvable distillation of Winfree.

The population’s mean phasor. r measures coherence: 0 when the phases are scattered, 1 when they march in lockstep. It is the arrow drawn on the circle and the number on the readout.

Solve for the apparent position θ given the true source β. When the source sits dead behind the mass, every solution is a circle — a full ring of radius θ_E. (This is the line the shader inverts per pixel.)

Remove the finite-variance condition (Cauchy / heavy tails) and the classical CLT is void: the sum stays a fat-tailed Lévy α-stable spike, no Gaussian ever forms — the wildness real markets live in (Mandelbrot vs Bachelier).

One law for every cell: a dead cell with exactly three live neighbours is born, a live cell with two or three survives, anything else is death by loneliness or crowding. No parameters at all.

Each cell counts only the eight around it (the Moore neighbourhood) and cares only about the total — not which neighbours are alive. A local, totalistic rule, exactly like The Rule one dimension down.

A ray grazing a mass bends by this angle — exactly twicethe Newtonian guess. Eddington’s eclipse confirmed it and made Einstein famous overnight.

A denser-than-average region pulls in more matter and grows denser still — runaway under its own gravity, slowed only by the cosmic expansion. While the contrast is small every patch grows by the same factor D(t): the rich get richer.

No friction: energy is conserved and phase-space volume is preserved. The system is deterministic and reversible — and still unpredictable. Determinism ≠ predictability.

Robert May’s 1976 toy ecology: a population is the previous one grown by r and damped by its own crowding (1 − x). One quadratic, iterated — and it breeds the full route to chaos.

The map between frames moving at relative speed β (units of c). It mixes space into time and time into space — which is why a boost shears the diagram instead of just sliding it.

The one number every observer measures the same. It is the metric of flat spacetime, and the reason the 45° cone is absolute while the axes are not.

The Lorentz factor. At β = 0 it is 1; as β → c it runs to infinity — moving clocks slow and moving rulers shrink without bound. The ember dot on the inset rides this curve.

Two events at the same time in one frame are not at the same time in another. "Now" is a frame-dependent slice — the root of every relativity paradox, drawn live in the Simultaneity scene.

The time a carried clock actually reads. The straight (inertial) path between two events racks up the most proper time, so the twin who turns around comes home younger — by exactly 1/γ.

Inside the cone (timelike, s² < 0) cause precedes effect for everyone — the order is absolute. Outside it (spacelike, s² > 0) no signal connects the events and their order is up for grabs.

Below ρ_c ≈ 24.74 the only attractors are the two fixed points C±. Above it they lose stability and the strange attractor is born — a fractal of dimension ≈ 2.06, never a surface, never a volume. This bifurcation is the instrument’s phase knob.

σ and ρ come from meteorology (Prandtl and Rayleigh numbers). Lorenz derived these equations in 1963 while modelling atmospheric convection rolls — and discovered chaos by accident when he re-ran a simulation from a rounded printout.

Prey x breed freely (α) and are eaten on encounter (βxy); predators y grow only by eating (δxy) and starve otherwise (γ). Two coupled rates — the minimal ecology, and the first answer to “if conditions change, what happens to the populations?”

The one nonzero state where both rates cancel. But it is a center, not an attractor: nudge the system and it does not return — it circles. Counter-intuitively, x* depends only on the predator’s constants and y* only on the prey’s.

Every trajectory rides a level set of V — Lotka–Volterra is conservative, like a frictionless pendulum or The Orbit’s two-body ellipse. The orbit you start on is the orbit you keep; the swing’s size is a memory of the initial state, not the parameters.

Average stretching per step. λ < 0 → nearby states converge (a predictable cycle); λ > 0 → they separate exponentially (chaos). In the period-3 window near r ≈ 3.83 it dips back below zero — order hiding inside the disorder.

Any gap, however small, grows exponentially. λ is the slope of the climbing line in the inset — measured live by Benettin’s method.

Every extra Lyapunov time τ costs another factor of ein the precision you’d need. You can’t buy much future: the cost grows exponentially, the reach only logarithmically.

Two nearby trajectories separate exponentially: δ(t) ≈ δ₀ e^λ₁t. If λ₁ >0 the system is chaotic — any uncertainty in the initial state doubles in 1/λ₁ ≈ 1.1 s. We measure λ₁ live by Benettin’s method: track a shadow orbit, renormalise, accumulate.

The boundary is endlessly detailed — Hausdorff dimension 2 (Shishikura) — with whole mini-Mandelbrots buried at every depth, and the same shape governs the chaos onset of any smooth family. Infinite structure, five symbols of law.

The black region: the set of c whose orbit of 0 never escapes. Outside, colour is the smooth escape rate — how many steps the point survives before it flies away.

No 3D multiplication behaves like the complex plane’s, so White & Nylander defined one by analogy: write the point in spherical coordinates (r, θ, φ), multiply the two angles by n and raise the radius to the n. The escape test |z| > 2 carries over unchanged.

Maxwell’s 1867 thought experiment: a tiny intelligent being controls a trap-door and sorts fast from slow molecules, creating a temperature difference without doing work — apparently defeating the second law. The resolution, completed by Landauer and Bennett, is that the demon’s memory must be erased, and that erasure generates entropy that restores the ledger.

Always take a downhill move; take an uphill move of cost ΔE only with probability e^−ΔE/T. High T accepts almost anything; as T → 0 only improvements pass. This one rule lets a search climb out of a trap.

How wrong the network is, averaged over every point. Squared so that big misses dominate and the surface is smooth — a landscape in weight space the optimiser can roll down.

Monte Carlo is the other half: roll N independent futures and the empirical distribution converges to the closed form at rate 1/√N. Watch the ember cloud tighten onto the cone as you raise N.

A profile where no player can do better by changing strategy alone. Every finite game has one. In the one-shot dilemma it is mutual defection — individually unbeatable, collectively the worst stable outcome.

The whole of classical fluid motion in two lines: a parcel accelerates from pressure gradients, viscous drag (ν∇²u) and any body force f. The constraint ∇·u = 0 says an incompressible fluid can swirl freely but never pile up.

Each neuron takes a weighted sum of the layer below plus a bias, then bends it through a non-linearity. Stack two such layers and the network can carve curved, disconnected regions — not just a single straight cut.

Every mass pulls every other. ε is Plummer softening — it rounds off the 1/r² singularity so a near-collision integrates cleanly instead of exploding.

The headline of 1948: codes exist that drive error to zero for any rate below capacity — and none above it. The wall p* is where R meets C. Our codes give out earlier; better ones reach all the way to it.

A photon travels perfectly straight; spacetime is curved, so its path curves with it. This is the exact orbit equation the instrument integrates per ray — not a thin-lens shortcut like The Well. The extra u² term is general relativity; drop it and you get Newton’s half-strength, straight-ish light.

Sample slower than twice the feature rate and the motion is lost — it can no longer be told apart from a slower one. This single inequality is the whole limit.

Scale-free in time as well as size: the activity’s power spectrum runs as 1/f, the ubiquitous flicker noise found in resistors, rivers, heartbeats and starlight — the puzzle self-organized criticality was invented to explain.

A node’s rank is the rank poured into it along incoming links, each source splitting its own rank evenly across its out-links. Importance is recursive — you matter if things that matter point at you — plus a small flat share (1−d)/N so nothing starves.

At p_c the cluster-size distribution is a power law — there is no characteristic scale, clusters of all sizes coexist. This scale-free structure is why the critical point looks fractal and why the exponents are the same across wildly different physical realisations.

The correlation length — the typical size of the largest finite cluster — diverges as p approaches p_c from either side, meaning the system "sees" arbitrarily large distances just at the critical point.

Below p_c only finite clusters exist. At p_c a giant cluster of infinite extent first appears (in the thermodynamic limit). Above p_c the giant component density P∞ grows as a power law — the order parameter of the transition.

The exponents β, ν, τ are universal — they do not depend on the lattice geometry (square, triangular, honeycomb) or the physical realisation. Only the spatial dimension d and the symmetry of the order parameter matter. That universality is why the same numbers describe water in rock, fire in a forest, and contagion in a network.

As r climbs, the stable cycle doubles: 1 → 2 → 4 → 8 → … The thresholds crowd together and accumulate at r∞ ≈ 3.5699, where the period becomes infinite — the door into chaos.

A positive matrix has one largest eigenvalue, and its eigenvector is all-positive and unique. That theorem is the guarantee under PageRank: exactly one rank vector, every entry a real fraction, and power iteration always finds it.

Trapped at a node, the phase has nowhere to point — so it winds a whole turn around the point. A quantised vortex, its charge always an integer. The ones the rings mark.

At exactly this radius gravity bends light into a circle. Rays that graze it wind around the hole many times before escaping, stacking into the thin bright photon ring at the rim of the shadow.

The gas willreturn arbitrarily close to its start — after a time that dwarfs the age of the universe. "Never," in practice, is a statement about how long you’d wait.

Just apply G again and again: any starting guess is dragged onto G’s leading eigenvector. It converges at the spectral gap — about a factor d per sweep — which is why ~50 passes rank the whole web.

Avalanche sizes have no characteristic scale: a straight line on a log–log plot. Most are tiny, a few are system-spanning, and the same law fits earthquakes, forest fires, extinctions and market crashes — the rare giant is not an anomaly, it is the tail of the everyday.

Reward R for mutual cooperation, punishment P for mutual defection, temptation T for defecting on a cooperator who gets the sucker payoff S. Whatever the other does, defecting scores more — yet two defectors both do worse than two cooperators. The trap of rational self-interest.

Because log S is Gaussian, every quantile is a formula: the silver cone. Its half-width grows like σ√t — uncertainty widens with the root of time, the same law as diffusion.

Probability actually flows, and its current is set by the gradient of the phase φ. Flat phase, no flow; a winding phase is a current going somewhere.

Feed the rule its own output, starting from zero. If |z| ever passes 2 the orbit escapes to infinity; otherwise it is trapped forever. That single yes/no, asked at every point, draws everything here.

On a contact network the right number uses the excess degree — who your neighbours’ neighbours are. A heavy-tailed (scale-free) degree distribution makes ⟨k²⟩ blow up, so hubs push R₀ far above the well-mixed estimate.

A sum of i.i.d. steps goes nowhere on average, yet its spread grows as the square root of the number of steps — the signature √t law of every diffusion.

Clocks tick slower deeper in the well; light climbing out loses energy and reddens, diverging as r → r_s. Together with the disk’s orbital Doppler shift it makes the approaching side blaze blue-white and the receding side fall dim and red.

The string-theory punchline: the same string at oscillator level n is a different particle, its mass climbing the Regge trajectory. n=1 is massless; the spectrum above is the particle zoo.

The single most important number in epidemiology: the average number of new infections one case produces in a fully susceptible population. Above 1 the outbreak grows; below 1 it dies.

Loschmidt’s objection: reversible micro-laws can’t logically give an irreversible world. The resolution is the Past Hypothesis — the universe began in a low-entropy state — plus sensitive dependence, which is why real reversal fails.

One dimensionless number decides everything: the ratio of inertia to viscosity. Low Re, the fluid moves in smooth sheets; past a critical value (~2000 in a pipe) it shatters into eddies on every scale. The readout above is this number, in the instrument’s own units.

A real predator can only catch and handle so much: at high prey density its kill rate saturates (handling time h). Swapping the cartoon βx for this curve is the step from the textbook cycle to a model that can settle — or crash.

Give the prey a carrying capacity K (à la The Cascade’s logistic growth) and the predator a saturating appetite f(x), and the neutral cycles resolve — into a stable equilibrium, or a self-sustaining limit cycle born in a Hopf bifurcation.

Raise the prey’s carrying capacity — enrich the system — and the stable point goes unstable: the populations swing wider and wider until a trough touches zero and someone goes extinct. Generosity destabilises. The same fragility The Cascade finds when a rate is pushed too hard.

Drop one grain on a cell. The instant a cell holds four, it spills one grain to each of its four neighbours — which may themselves topple. One grain can set off a chain reaction: an avalanche.

On scale-free networks the threshold can vanish entirely: with a diverging ⟨k²⟩ any transmissibility spreads. The cure is not more vaccine but smarter targeting — immunise the hubs and the giant component shatters.

The wavefunction’s whole future, set by its curvature and the potential V. It is complex — amplitude and phase — and only the pair together is the state.

The wave function’s whole future, set by its curvature and the potential V. We solve it exactly in time by splitting it into a potential kick and a kinetic drift.

Clocks deeper in the well tick slower (the −(1−r_s/r) term). The event horizon is at r_s = 2GM/c², where the escape speed reaches light.

Add grains slowly, let avalanches run fast, and the pile climbs to the critical slope and stays there — balanced at the edge with no parameter tuned. The critical point is an attractor, not a setting. This is what The Threshold, The Percolation and The Cascade had to be dialled to by hand.

Stam’s insight: don’t step the velocity forward (which blows up), trace it backward — ask where each parcel came from and copy that value. This semi-Lagrangian advection is unconditionally stable, which is why it runs in real time in your browser.

The classical well-mixed model: susceptibles become infected in proportion to contacts between S and I, and infecteds recover at rate γ. The whole epidemic is a flow S → I → R.

Each site opens independently with probability p. Two open sites belong to the same cluster iff a path of open nearest-neighbours (up/down/left/right) connects them — the von Neumann neighbourhood.

Each cell plays its eight neighbours, sums its payoff, then adopts the strategy of whoever scored highest nearby (itself included). No memory, no foresight, no referee — and yet cooperation organizes in space.

We solve it exactly per step by splitting: a potential kick in real space, a kinetic drift in Fourier space (where −½∇² is just ×|k|²/2). Unitary — |ψ|² is conserved.

Only a whole number of half-waves fits, so the solutions are a harmonic series: mode n has n loops and frequency exactly n times the fundamental — quantisation straight out of geometry.

The rank is the equilibrium of a Markov chain — the fraction of eternity a blind random surfer spends at each node. Run one walker forever, or solve for the fixed point: the same vector. Kin to The Walk, set on a graph.

A subthreshold signal — too weak to cross a detection threshold on its own — can become detectable by adding the right amount of noise. The output signal-to-noise ratio rises with noise from zero, peaks at an optimal amplitude, then falls again. Noise is not just a nuisance; here it is the carrier.

When the strobe lands exactly on a spoke-pass the fold hits zero — frozen. Sample a touch faster and it tips negative: the wheel runs backward while it truly turns forward.

A periodic signal of amplitude A sits below detection threshold θ — by itself it never fires the detector. Adding Gaussian white noise σ ξ(t) creates random barrier crossings; at the right σ, crossings cluster at the signal’s peaks and the output becomes correlated with the input. Biological sensory neurons, inner-ear hair cells, and crayfish mechanoreceptors all appear to operate near this optimal noise level.

Leó Szilárd’s one-molecule heat engine: a demon who measures which half of a box the molecule is in can extract k_BT ln 2 of work per cycle. But the demon must erase that single bit afterward — and that erasure, Landauer showed three decades later, costs exactly what was gained.

For almost any delay τ and any m more than twice the attractor’s dimension d, the delay map is a diffeomorphism — the reconstruction has the same topology and the same invariants (Lyapunov λ, fractal dimension) as the real thing. The geometry survives the shadow.

Open by cooperating, then echo your opponent’s last move. Nice, retaliatory, forgiving and clear — it won Axelrod’s tournament against every craftier rule. The spatial grid trades this memory for neighbourhood structure: clustering does the work repetition once did.

The exact leak for one sharp energy. The sinh makes it fall exponentially with width a and with √(V₀−E) — why a hair more wall kills it.

Probability is conserved: what doesn’t get through comes back. The instrument measures T by integrating |ψ|² past the wall — its own answer for a packet of many energies.

Short-range activation, long-range inhibition: when the inhibitor diffuses faster (D_v ≫ D_u), one wavelength λ* wins and tiles the plane.

Two morphogens, each diffusing and reacting. Turing’s shock: diffusion, usually a smoother, can destabilise a uniform state and manufacture pattern.

The honest measure of clustering: how much more likely than chance you are to find a second clump a distance r from a first. It climbs from zero as the web sharpens — read live as the cloud collapses.

A single-slit diffraction envelope times a two-slit interference fringe. The cos² term is the interference; kill it and only the smooth envelope is left.

Why one hidden layer is, in principle, enough: a wide enough network of these neurons can approximate any continuous function. Capacity is the catch — Spiral needs more units to bend the boundary far enough.

Replace steering with "copy the average heading of your neighbours, plus a kick of noise η". This minimal model is the one with an exact order parameter and a phase transition.

A clamped string obeys the wave equation with both ends pinned. Those boundary conditions are the whole story — they force the continuous string into a discrete set of allowed shapes.

The exact trade. V is fringe contrast (wave), D is how well the path is known (particle). You can buy one only by selling the other — never both at once.

No signal is sharp in both time and frequency: their spreads multiply to a fixed floor. The Gaussian alone meets it — the classical twin of Heisenberg’s Δx·Δp ≥ ℏ/2.

Correlate the signal against one little wave ψ, scaled by a (≈ 1/frequency) and slid to time b. |W|² is the scalogram — energy laid across time and frequency at once.

A complex sinusoid wrapped in a Gaussian. The width ω₀ is its wiggle-count: more of them sharpens frequency and blurs time, fewer does the reverse — the one knob on the trade.

For the transform to invert, the wavelet must average to zero — a true little wave, not a lump. That’s why ω₀ can’t fall too low: too few wiggles and the mean stops vanishing.

A free packet doesn’t hold together — the faster components outrun the slow, so σ grows with time. The spread you watch is the price of ever having localised it.

Index the neighbourhood by its bits, k = 4s_i−1 + 2s_i + s_i+1, and the rule number R is literally the truth table — bit k of R is the next state.

Instead of summing forces between millions of particles, give each one a fixed shove from the initial field and slide it that way, scaled by the growth D(t). Crude once paths cross — but it draws the whole cosmic web of sheets, filaments and knots almost for free. This instrument runs exactly this.