The dying art of the hatchet job An Article by Dorian Lynskey staging.unherd.com I find that the act of disagreeing with a sharp takedown sharpens my appreciation of the work in question. If I have to think a bit harder about what I like and why I like it, that’s fine by me, especially when it’s something that has been almost universally acclaimed. ...It’s not that I long for an epidemic of gleeful brutality but I will always cherish the right of critics to express their hate, hate, hate in the ultimate service of what they love, love, love. critique
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