You live only once The logician would argue, You only live once should be rewritten as You live only once, with only next to the thing it qualifies, once. The logician would be unbearably pedantic, but there is a grain of good taste in the pedantry. Writing is often clearer and more elegant when a writer pushes an only or a not next to the thing that it quantifies. In 1962 John F. Kennedy declared, “We choose to go to the moon not because it is easy but because it is hard.” That sounds a lot classier than “We don’t choose to go to the moon because it is easy but because it is hard." Steven Pinker, The Sense of Style grammar
Wang tiles 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. Wikipedia en.wikipedia.org Truchet TilesThe Tiling Patterns of Sebastien Truchet and the Topology of Structural Hierarchy mathalgorithms