by Jochen Szangolies
The previous column left us with the tantalizing possibility of connecting Gödelian undecidability to quantum mechanical indeterminacy. At this point, however, we need to step back a little.
Gödel’s result inhabits the rarefied realm of mathematical logic, with its crisply stated axioms and crystalline, immutable truths. It is not at all clear whether it should have any counterpart in the world of physics, where ultimately, experiment trumps pure reason.
However, there is a broad correspondence between physical and mathematical systems: in each case, we start with some information—the axioms or the initial state—apply a certain transformation—drawing inferences or evolving the system in time—and end up with new information—the theorem to be proved, or the system’s final state. An analogy to undecidability then would be an endpoint that can’t be reached—a theorem that can’t be proven, or a cat whose fate remains uncertain.
Perhaps this way of putting it looks familiar: there is another class of systems that obeys this general structure, and which were indeed the first point of contact of undecidability with the real world—namely, computers. A computer takes initial data (an input), performs a transformation (executes a program), and produces a result (the output). Moreover, computers are physical devices: concrete machines carrying out computations. And as it turns out, there exists questions about these devices that are undecidable. Read more »