Analog Computation and Isomorphism
A first pass. Incomplete by design.
Part of the track Derived, Borrowed, Learned
The original meaning of "analog"
Before "analog" meant "not digital", it meant "by analogy". An analog computer is a physical system arranged so that its behavior mirrors the behavior of the system you want to understand. You then read the answer off the mirror.
Examples:
- Tide-predicting machines (Kelvin, 1870s): gears and pulleys whose motion summed harmonic components of the tide.
- Wind tunnels: a scaled airflow that is analogous to flight, used because the equations of turbulence could not be solved.
- The MONIAC (1949): water flowing through tanks and valves as an analog of the British economy.
- The Chladni plate: sand on a vibrating plate settles into the nodal lines of the plate's modes; the plate computes its own eigenfunctions. The quantum primer uses this image.
Analog computers fell out of use because digital machines were more general and more precise. They did not stop being a valid idea.
Isomorphism
When the analogy is not approximate but exact, so that the equations governing the model and the equations governing the system have the same form, the precise term is isomorphism. Two isomorphic systems can stand in for one another without loss.
Why quantum simulation is the deepest analog computer
A quantum simulator is isomorphic to the molecule it simulates at the level of the physics itself. The qubits obey the Schrödinger equation; so do the electrons. Nothing is approximated in the mapping, though a great deal is engineered around it. See Quantum SimulationNoteSeedQuantum SimulationFeynman's 1982 proposal and Lloyd's 1996 proof: a quantum computer can efficiently simulate any local quantum system. The case where the machine and the problem share the same physics.. On the The Structure GradientNoteSeedThe Structure GradientComputational advantage depends on how much structure a problem has and where the structure comes from: isomorphic (the problem is physics), structural (hidden mathematical regularity), or generic (nothing to exploit). Derived, borrowed, or learned. this is the leftmost point, and it is why "the computer becomes the molecule" is a fair sentence with one caveat: the model still has to be compiled.
Where the idea reaches its limit
For an analog computer to exist there must be a physical system that behaves like the target. Molecules have one (other quantum systems). Markets do not: there is no physical substrate that behaves like a market and can be run forward. Whether populations of language-model agents could serve as that substrate is an open question, and it is the subject of World models: two meanings of one termNoteSeedWorld models: two meanings of one termThe phrase 'world model' now covers two different research programs: a learned dynamics model an agent plans inside, and a generative model of visual or 3D space. This note separates them and explains why the distinction matters. and ReflexivityNoteSeedReflexivityA model of a market changes the market. Soros's reflexivity, the Lucas critique, and Goodhart's law are three statements of the same limit, and it is the one way markets are permanently harder than chemistry: molecules do not read the paper..
Review log
- 2026-09-08: seeded to hold the analog/isomorphism vocabulary shared by both essays.
Appears in
Essays that draw on this note.
- The Resolution of RealityA primer on quantum computing: how physical law replaces brute-force search, why the advantage depends on how native the problem is to the machine, and where hybrid classical-quantum architectures fit.
Links out
- Quantum SimulationFeynman's 1982 proposal and Lloyd's 1996 proof: a quantum computer can efficiently simulate any local quantum system. The case where the machine and the problem share the same physics.
- The Structure GradientComputational advantage depends on how much structure a problem has and where the structure comes from: isomorphic (the problem is physics), structural (hidden mathematical regularity), or generic (nothing to exploit). Derived, borrowed, or learned.
- World models: two meanings of one termThe phrase 'world model' now covers two different research programs: a learned dynamics model an agent plans inside, and a generative model of visual or 3D space. This note separates them and explains why the distinction matters.
- ReflexivityA model of a market changes the market. Soros's reflexivity, the Lucas critique, and Goodhart's law are three statements of the same limit, and it is the one way markets are permanently harder than chemistry: molecules do not read the paper.
Referenced by
Other notes and pages that link here.
- Key Quantum Algorithms: Shor, Grover, and SimulationThe three algorithm families that define what quantum computers are for, the speedup each delivers, and why the speedups differ. Originally Appendix D of The Resolution of Reality.
- Quantum SimulationFeynman's 1982 proposal and Lloyd's 1996 proof: a quantum computer can efficiently simulate any local quantum system. The case where the machine and the problem share the same physics.
- The Structure GradientComputational advantage depends on how much structure a problem has and where the structure comes from: isomorphic (the problem is physics), structural (hidden mathematical regularity), or generic (nothing to exploit). Derived, borrowed, or learned.