What do we mean by consistency? I know some people are going to say: "Hey! That's Dan Flavin's act. Why in the hell is Irwin doing a Dan Flavin? Why is he suddenly so inconsistent – fluorescent one day and Cor-Ten the next?" The key to all of this is that we have to examples what we mean by consistency. And here the critical question is: "what do we use to measure consistency with?" If you measure consistency in terms of material, or gesture, then I will be found inconsistent. But, in all of the recent pieces and proposals, if you go to the actual site and look at it, you will find that the solution is absolutely consistent on the grounds within which it responds to its environment. This in turn is consistent with my development of the implications implicit in non-object art. Robert Irwin, Robert Irwin: A Conditional Art consistency
What's suitable for each unique condition What of machines and prefabrication? How do they compare? Well, the machine has its limits. We, using handcrafted methods, do things that machines cannot do. Of course, it's not fast like a machine. And in complicated areas like here, things wouldn't go the same using a machine as it would by hand. We use numerous variations of all these connecting and splicing joints. Using a machine, [the wood joints] can all be made uniform, but really, we need to consider whether that's a good thing. It's better to make each mechanism and joint by considering what's suitable for each unique condition. Akinori Abo, Kigumi House Chopped and disfigured contextmachinesconsistency
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