I recommend eating chips An Essay by Sam Anderson www.nytimes.com Join me. Grab whatever you’ve got. Open the bag. Pinch it on its crinkly edges and pull apart the seams. Now we’re in business: We have broken the seal. The inside of the bag is silver and shining, a marvel of engineering — strong and flexible and reflective, like an astronaut suit. Lean in, inhale that unmistakable bouquet: toasted corn, dopamine, America, grief! We are the first humans to see these chips since they left the factory who knows when. They have been waiting for us, embalmed in preservatives, like a pharaoh in his dark tomb. Looking Closely is EverythingOne brick seeingdetailsfood
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