The getaway to end all getaways Any attempt to track down the perfect getaway is made all the more complex because almost everything we know about burglary—including how they did (or did not) get away—comes from the burglars we’ve caught. As sociologist R. I. Mawby pithily phrases this dilemma, “Known burglars are unrepresentative of burglars in general.” Great methodological despair is hidden in such a comment. Studying burglary is thus a strangely Heisenbergian undertaking, riddled with uncertainty and distorted by moving data points. The getaway to end all getaways—the one that leaves us all scratching our heads—to no small extent remains impossible to study. Geoff Manaugh, A Burglar's Guide to the City failure
The Evolution of Useful Things A Book by Henry Petroski Here, then, is the central idea: the form of made things is always subject to change in response to their real or perceived shortcomings, their failures to function properly. This principle governs all invention, innovation, ingenuity. Spike and sponShaped and reshapedForm follows failureTheir wrongness is somehow more immediateA small corner of the world of things+23 More The evolution of devices formfunctioninventionprogressfailure
My Anti-Resumé An Article by Monica Byrne monicacatherine.com A couple years ago I was having dinner with a playwright, Bekah Brunstetter, and her director David Shmidt Chapman. We talked about how rejection is just part of the landscape for all beginning artists, no matter how talented or hardworking they might be or how successful they might appear. David said he’d love to publish his “anti-résumé” someday—a list of all the things he didn’t get. Spreadsheet Portfolios for UX Designers workfailure
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