AI-generated artwork is the same as a gallery of rock faces. It is pareidolia, an illusion of art, and if culture falls for that illusion we will lose something irreplaceable. We will lose art as an act of communication, and with it, the special place of consciousness in the production of the beautiful.
…Just as how something being either an original Da Vinci or a forgery does matter, even if side-by-side you couldn’t tell them apart, so too with two paintings, one made by a human and the other by an AI. Even if no one could tell them apart, one lacks all intentionality. It is a forgery, not of a specific work of art, but of the meaning behind art.
Like a programming language interpreter, GPT-3 translates the designer’s intent from a language they’re already familiar with (English) to one they need to learn (Figma’s information architecture, as manifested in its UI.) This can be easier for a new/busy designer, much like Python is easier and faster to work with than assembly language.
But that’s not “designing” — at least not any more than compiling Python code is “programming.” In both cases, all the system does is translate human intent into a lower level of abstraction. Sure, the process saves time — but the key is getting the intent part right. I’ll be convinced the system is “designing” when it can produce a meaningful output to a directive like “change the product page’s layout to increase conversions.”
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.