When we enter the world of refuse and waste, we cross over into a mirror-image economy. In the "normal" world, we pay to acquire things; on the other side of the looking glass, we pay to get rid of them. Junk isn't merely worthless; it has negative value.
A chemical engineer once told me about a recent improvement in a manufacturing process; by fine-tuning a chemical synthesis he had increased the yield of a certain commodity from 98 percent to 99 percent. I congratulated him, but I couldn't help remarking that this seemed like a rather paltry improvement. "Ah, you miss the important point," he said. "The amount of waste goes from 2 percent down to 1 percent. It's cut in half. We save tremendously on disposal costs."
There’s a movement called the circular economy which is about designing services that don’t include throwing things away. There is no “away.”
A non-extractive economy is going to look very different to today’s economy. These points feel opposed somehow but they are part of the same movement:
With CupClub, it’s all about infrastructure.
With the battery-free Game Boy, it’s untethered from infrastructure: once manufactured, no nationwide electricity grid is required to play.
We’ll need better tools to track and measure. There will be new patterns for new types of services. New technologies to build new products. New language. So it’s fascinating seeing the pieces gradually come together.
Wang tiles (Hao Wang, 1961) are a class of formal systems. They are modelled visually by square tiles with a color on each side. A set of such tiles is selected, and copies of the tiles are arranged side by side with matching colors, without rotating or reflecting them.
The basic question about a set of Wang tiles is whether it can tile the plane or not, i.e., whether an entire infinite plane can be filled this way. The next question is whether this can be done in a periodic pattern.
In 1966, Wang's student Robert Berger solved the problem in the negative. He proved that no algorithm for the problem can exist, by showing how to translate any Turing machine into a set of Wang tiles that tiles the plane if and only if the Turing machine does not halt. The undecidability of the halting problem then implies the undecidability of Wang's tiling problem.