Perspectives
Where the universal explanatory language Analogy Breaks
If every physical evolution can be called computation under some mapping, the claim risks becoming too broad to explain anything. A weather simulation computes a model of a storm; the storm obeys atmospheric…
Calling computation a universal explanatory language is useful for about five minutes. The comparison can expose structure that ordinary language hides. The problem begins when the comparison stops behaving like a tool and starts behaving like a claim about what the thing literally is.
Software architecture teaches that the same computation can run on different hardware and the same hardware can realize many abstractions. That flexibility is why computational metaphors travel so easily.
What the metaphor gets right
Software architecture teaches that the same computation can run on different hardware and the same hardware can realize many abstractions. That flexibility is why computational metaphors travel so easily.
This is why engineering metaphors are so attractive. They compress a complicated relationship into something we can manipulate mentally. In the best case, the metaphor produces predictions and sharper questions.
What it smuggles in
If every physical evolution can be called computation under some mapping, the claim risks becoming too broad to explain anything. A weather simulation computes a model of a storm; the storm obeys atmospheric physics.
Engineering words often carry hidden assumptions: a designer, a specification, modular ownership, explicit goals, a stable machine underneath the program. Those assumptions must be tested rather than inherited.
Return to the physical story
Computation formally transforms representations according to rules, but a physical system instantiates a computation only under a mapping between physical states and computational states. Different computational models choose different abstractions.
Once the mechanism is back in view, the analogy can be kept on a short leash. We can state which relation is genuinely similar and which difference would make the analogy generate a wrong prediction.
My three tests for a metaphor
- What mechanism does this comparison help me see?
- Which engineering assumption does the natural system not share?
- What would I predict incorrectly if I took the comparison literally?
The third test is the most important. An analogy that cannot fail is decoration, not explanation.
Beyond the borrowed language
Turing and others formalized computation before digital computers became ordinary machines; computer science later exported the concept far beyond programming.
The crucial philosophical question is not whether the universe can be described computationally, but what that description lets us predict or explain.
What evidence would distinguish 'can be modeled as computation' from 'is computing'?
A good metaphor should eventually make itself less necessary. It gets us close enough to the real system that we can see where the scaffolding ends.
Reading trail
These links are starting points for the scientific and historical ideas. The systems interpretation, analogies and conclusions here are my own.