Be A (Re)Visitor An Article by Rob Walker robwalker.substack.com I was thinking about this not long ago while reading in Petapixel an essay by a photographer named Scott Reither, “Long Form Study: Why Photographers Should Repeatedly Revisit A Scene.” In it, he described photographing one particular stretch of beach, over and over, throughout his career. Of course that landscape has changed over time, and of course he’s had moments when he felt he’d captured the same territory so many times there was nothing left to see. But there was always something more to see — maybe because of a change in Reither’s life, rather than in the physical environment. seeingchangephotography
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