To prove it in purity The series of photos of the 1959 model ends or stops with the photograph in which Kiesler triumphantly shows us the shell of his house like the remains of a creature taken from the seabed, a kind of Moby Dick harpooned and finally captured after the obsessive pursuit of a project that has taken up ten years of the life of the architect. "I think that everybody has only one basic creative idea and no matter how he is driven off, you will find that he always comes back to it until he has a chance to prove it in purity, or die with the idea unrealized." — Frederick Kiesler Smiljan Radić, Some Remains of My Heroes Found Scattered Across a Vacant Lot creativitylifeobsessionpassion
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