Brownian Computers and DNA

Charles Bennett gave reversible computing two great gifts. The first was the reversible Turing machine. The second is stranger and, if anything, deeper: a computer that random-walks through its own computation. Instead of being pushed forward step by step by a clock, a Brownian computer is jostled by thermal noise and diffuses — sometimes forward, sometimes backward — along the chain of states of a reversible Turing machine. It gets to the answer not by marching but by wandering, nudged in the right direction by the faintest of breezes.

Computing by random walk

Because the underlying machine is reversible, every configuration has exactly one predecessor and one successor: the states form a single unbranched chain, forward computation on one side, the already-done past on the other. A Brownian computer sits somewhere on this chain and, kicked by kT-scale noise, hops to a neighbouring configuration at random. With no preference it would drift aimlessly. To make progress you apply a small free-energy bias \varepsilon per step — a gentle downhill tilt — so that forward hops are slightly more likely than backward ones.

The remarkable part is how cheap this can be. The dissipation per committed step is of order the bias itself, and the drift speed is (for small bias) proportional to the bias:

v \;\propto\; \varepsilon, \qquad \text{dissipation per step} \;\sim\; \varepsilon.

So if you accept a smaller \varepsilon — slower, less certain progress — you dissipate less, and there is no lower bound imposed by logic: unlike erasure's fixed kT\ln 2, the cost here can slide towards zero as you slow down. You trade speed for thermodynamic economy on a smooth curve.

Nature got there first — by about four billion years

This is not a thought experiment dreamed up in a lab. It is the operating principle of the machinery inside every living cell. When RNA polymerase transcribes DNA, it does not march rigidly along the strand; it jiggles, stepping forward and backward, driven forward by a small chemical free-energy bias per base added. It even backtracks and proofreads — running the computation in reverse to check its work — which is exactly the behaviour of a near-reversible Brownian machine. Including its error-correction, transcription dissipates on the order of 20\text{–}100\,kT per base, remarkably close to the theoretical kT-scale minimum.

The same design recurs everywhere: DNA polymerase copying the genome, ribosomes translating messenger RNA into protein, and molecular motors like kinesin walking cargo along microtubules — all are biased random walkers, rectifying thermal noise into directed work with tiny per-step dissipation. Life, it turns out, discovered low-dissipation reversible computing roughly four billion years before Bennett wrote it down.

Engineering it: DNA computing

Modern DNA computing takes this biological insight into the lab deliberately. Strand-displacement circuits — most elegantly the seesaw gates of Qian and Winfree — compute by letting strands of DNA competitively bind and unbind, an engineered near-equilibrium chemistry where the reactions run gently forward and back. Whole logic circuits, including a square-root calculator and small neural networks, have been built from nothing but carefully designed DNA strands in a test tube. They are slow (minutes to hours) and error-prone, but they are real, and they operate right at the near-reversible boundary that Bennett's Brownian model describes.

a reversible machine's configurations form a single chain; thermal noise lets the state diffuse forward and backward along it;
a small free-energy bias \varepsilon per step gives net forward drift, with speed \propto \varepsilon and dissipation \sim \varepsilon per committed step;
the cost has no logical floor — slower computation can dissipate arbitrarily little, unlike erasure's fixed kT\ln 2;
biology already computes this way: polymerases, ribosomes and molecular motors are biased random walkers near the thermodynamic minimum.

RNA polymerase deliberately steps backwards, chews off recently added bases, and re-adds them. Wasteful? No — it is the price of accuracy, and it is only affordable because the machine is near-reversible. If each forward step were slammed home irreversibly at high dissipation, undoing a mistake would be prohibitively expensive; you would be stuck with your errors. By keeping the forward bias small, the polymerase leaves each step nearly reversible, so a wrong base can be diffused back out almost for free and replaced. Reversibility is not a curiosity of the cell — it is what makes cheap, high-fidelity copying of your genome physically possible.

It is tempting to push the logic all the way: if smaller bias means less dissipation, why not set the bias to zero and compute for free? Because an unbiased random walk has no preferred direction. Its expected displacement is zero; it wanders forward and backward in equal measure and, on average, makes no net progress at all. It might momentarily brush the answer, but it will drift straight back off it. To commit to having finished — to make the answer stick — you must pay something: a nonzero bias per committed step. You can make that payment as small as your patience allows, but you cannot make it zero. Free computation is a limit you approach, never reach.