You need to make the step forward Throughout a racing season there is constant, relentless pressure on the designer to keep making design improvements. But there is a limit to what can be achieved with any car design, before a jump has to be made to basically a new design, an innovation. As Gordon Murray says, ‘Given the situation and the pressure at any one time, you do get to the brick wall...I mean you're doing all these normal modifications, you know you can't go any quicker, you need to make the step forward.’ In the midst of the pressure, the fervour, the panic, he ‘used to get breakthroughs, I mean I used to get like suddenly a mental block's lifted.’ Gordon Murray, Winning by Design: The Methods of Gordon Murray The Structure of Scientific RevolutionsMediocratopia progress
Drawing the bits That's what is great about race car design, because even though you've had the big idea - the “light bulb” thing, which is fun - the real fun is actually taking these individual things, that nobody's every done before, and in no time at all try and think of a way of designing them. And not only think of a way of doing them, but drawing the bits, having them made and testing them. Gordon Murray, Winning by Design: The Methods of Gordon Murray
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