Behold! I have an opinion. An EXCLUSIVE opinion. An Article by Heather Burns webdevlaw.uk Part of the joy of working in digital policy in the UK is that many of your days start like this: I, a Tory politician, have a brilliant plan / erudite commentary / a policy announcement on tech policy strategy. Click here to read it in this EXCLUSIVE Elite Broadsheet Newspaper piece. We all know full well that this is how the game of politics works. These brilliant plans, erudite commentaries, and policy announcements aren’t made for you plebs. They’re made for the machine to feed the beast inside it. politicssurveillance
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