The Nintendo way of adapting technology is not to look for the state of the art but to utilize mature technology that can be mass-produced cheaply.
This is the reason a Nintendo console never has the fastest chips or the beefiest specs of its generation; instead, its remixes components in an interesting and generative way. Think of the Gameboy’s monochrome screen, the Wii’s motion controller, the Switch’s smartphone form.
[Gunpei Yokoi] is talking about reliability and predictability, in performance and supply alike. He wants the components to be boring, so their application can be daring.
This visualization takes the current New York Times Best Sellers list for combined print and e-book fiction and scales each title according to the demand for its e-book edition at a collection of U.S. public libraries, selected for their size and geographic diversity.
This is a kind of manifesto about the difference between liking something on the internet and loving something on the internet.
It’s also an experiment in a new format: a “tap essay,” presenting its argument tap by tap, making its case with typography, color, and a few surprises.
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.