Gifts of knowledge to humanity There are many commonalities we can admire in these endeavors: the dazzling leap of imagination, the broad scope of applicability, the founding of a new paradigm. But let’s focus here on their form of distribution. These are all things that are taught. To “use” them means to learn them, understand them, internalize them, perform them with one’s own hands. They are free to any open mind. In Hamming’s world, great achievements are gifts of knowledge to humanity. Bret Victor, The Art of Doing Science and Engineering: Learning to Learn knowledge
Hamming-greatness Hamming-greatness is tied, inseparably, with the conception of science and engineering as public service. This school of thought is not extinct today, but it is rare, and doing such work is not impossible, but fights a nearly overwhelming current. Bret Victor, The Art of Doing Science and Engineering: Learning to Learn
Up and Down the Ladder of Abstraction An Essay by Bret Victor worrydream.com The most powerful way to gain insight into a system is by moving between levels of abstraction. Many designers do this instinctively. But it's easy to get stuck on the ground, experiencing concrete systems with no higher-level view. It's also easy to get stuck in the clouds, working entirely with abstract equations or aggregate statistics. This interactive essay presents the ladder of abstraction, a technique for thinking explicitly about these levels, so a designer can move among them consciously and confidently. From a roving viewpoint abstractionunderstandinginteraction
The Ladder of Abstraction An Essay by Bret Victor worrydream.com Collaborative Information Architecture at Scale informationthinkingcommunicationabstraction
A Brief Rant An Essay by Bret Victor worrydream.com Like, just a post complaining that screens should be better designtechnologywwwinteractionbody
The Future of Programming A Talk by Bret Victor worrydream.com programmingcodetechnologyinteractionsoftware
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