Heuristics That Almost Always Work An Article by Scott Alexander astralcodexten.substack.com Sometimes there’s a Heuristic That Almost Always Works, like “this technology won’t change everything” or “there won’t be a hurricane tomorrow”. And sometimes the rare exceptions are so important to spot that we charge experts with the task. But the heuristics are so hard to beat that the experts themselves might be tempted to secretly rely on them, while publicly pretending to use more subtle forms of expertise. …Maybe this is because the experts are stupid and lazy. Or maybe it’s social pressure: failure because you didn’t follow a well-known heuristic that even a rock can get right is more humiliating than failure because you didn’t predict a subtle phenomenon that nobody else predicted either. Or maybe it’s because false positives are more common (albeit less important) than false negatives, and so over any “reasonable” timescale the people who never give false positives look more accurate and get selected for. expertiseheuristicsprediction
Beauty and compression An Article by Scott Alexander astralcodexten.substack.com The Buddha discusses states of extreme bliss attainable through meditation: Secluded from sensual pleasures, secluded from unwholesome states, a bhikkhu enters and dwells in the first jhāna, which is accompanied by thought and examination, with rapture and happiness born of seclusion. ...If you could really concentrate on a metronome, it would be more blissful than a symphony. The jhāna is also a strong contender as a theory of beauty: beauty is that which is compressible but has not already been compressed. The Abode of the Unsymmetrical beautysilencesensesattention
Negative Creativity An Article by Scott Alexander slatestarcodex.com Coming up with entirely novel ideas is really, really hard. Misinterpretation as inspirationSit Down And Think About It For Five Minutes ideascreativitymetaphor
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