Low-complexity art

Low-complexity art, first described by Jürgen Schmidhuber in 1997[1] and now established as a seminal topic within the larger field of computer science,[2][3][4][5][6] is art that can be described by a short computer program (that is, a computer program of small Kolmogorov complexity).

Overview

Schmidhuber characterizes low-complexity art as the computer age equivalent of minimal art. He also describes an algorithmic theory of beauty and aesthetics based on the principles of algorithmic information theory and minimum description length. It explicitly addresses the subjectivity of the observer and postulates that among several input data classified as comparable by a given subjective observer, the most pleasing one has the shortest description, given the observer’s previous knowledge and his or her particular method for encoding the data. For example, mathematicians enjoy simple proofs with a short description in their formal language (sometimes called mathematical beauty). Another example draws inspiration from 15th century proportion studies by Leonardo da Vinci and Albrecht Dürer: the proportions of a beautiful human face can be described by very few bits of information.[7][8]

Schmidhuber explicitly distinguishes between beauty and interestingness. He assumes that any observer continually tries to improve the predictability and compressibility of the observations by discovering regularities such as repetitions and symmetries and fractal self-similarity. When the observer's learning process (which may be a predictive neural network) leads to improved data compression the number of bits required to describe the data decreases. The temporary interestingness of the data corresponds to the number of saved bits, and thus (in the continuum limit) to the first derivative of subjectively perceived beauty. A reinforcement learning algorithm can be used to maximize the future expected data compression progress. It will motivate the learning observer to execute action sequences that cause additional interesting input data with yet unknown but learnable predictability or regularity. The principles can be implemented on artificial agents which then exhibit a form of artificial curiosity.[9]

While low-complexity art does not require a priori restrictions of the description size, the basic ideas are related to the size-restricted intro categories of the demoscene, where very short computer programs are used to generate pleasing graphical and musical output.

The larger context

The larger context provided by the histories of both art and science suggests that low-complexity art will continue to be a topic of growing interest.

In respect to the trajectory of science and technology, for example, low-complexity art may represent another case in which the relatively new discipline of computer science is able to shed fresh light on a disparate subject — the classic example being those insights into the functioning of the genetic code garnered in no small part because of a familiarity with issues already raised in the practice of software engineering.[10] We may thus expect the topic of low-complexity art to help foster a continued and fruitful interaction between the fields of computer science and aesthetics. Nor will the insights gained be purely qualitative; indeed, the formalizations on which low-complexity art is based are essentially quantitative.[5]

In respect to art history, likewise, the potential relevance of low-complexity art extends far beyond the minimalistic Renaissance encoding of beauty already cited in its literature. The idea of an intimate relationship between mathematical structure and visual appeal is one of the recurring themes of Western art and is prominent during several of its periods of fluorescence including that of dynastic Egypt;[11] Greece of the classic era;[12] the Renaissance (as already noted); and on into the Geometric abstraction of the 20th century, especially as practiced by Georges Vantongerloo[13] and Max Bill.[14]

See also

References

  1. ↑ J. Schmidhuber. Low-complexity art. Leonardo, Journal of the International Society for the Arts, Sciences, and Technology, 30(2):97–103, 1997. http://www.jstor.org/pss/1576418
  2. ↑ McCormack, John and Mark d'Inverno, "Computers and Creativity", Springer, 2012, p. 323.
  3. ↑ Kharkhurin, Anatoliy V., "Multilingualism and Creativity", Multilingual Matters, 2012, p. 122.
  4. ↑ Li, Ming and Paul M.B. Vitányi, "An Introduction to Kolmogorov Complexity and Its Applications", Springer, 2008, p. 755.
  5. 1 2 DiChio, Cecilia, "Applications of Evolutionary Computation", Springer, 2010, p. 302.
  6. ↑ Parisi, Luciana, "Contagious Architecture: Computation, Aesthetics, and Space", MIT Press, 2013, p. 290.
  7. ↑ J. Schmidhuber. Facial beauty and fractal geometry. Cogprint Archive: http://cogprints.soton.ac.uk , 1998
  8. ↑ J. Schmidhuber. Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity. Proc. 10th Intl. Conf. on Discovery Science (DS 2007) p. 26-38, LNAI 4755, Springer, 2007. Also in Proc. 18th Intl. Conf. on Algorithmic Learning Theory (ALT 2007) p. 32, LNAI 4754, Springer, 2007. Joint invited lecture for DS 2007 and ALT 2007, Sendai, Japan, 2007. http://arxiv.org/abs/0709.0674
  9. ↑ J. Schmidhuber. Curious model-building control systems. International Joint Conference on Neural Networks, Singapore, vol 2, 1458–1463. IEEE press, 1991
  10. ↑ Atlan, H. and M. Koppel (1990). "The cellular computer DNA: program or data". Bulletin of Mathematical Biology. Retrieved April 26, 2015.
  11. ↑ Legon, John. "The Cubit and the Egyptian Canon of Art". Retrieved April 26, 2015.
  12. ↑ "Polyclitus's Canon and the Idea of Symmetria". SUNY Oneonta. Retrieved April 26, 2015.
  13. ↑ "The Collection: Georges Vantongerloo". The Museum of Modern Art. Retrieved April 24, 2015.
  14. ↑ Smith, Roberta (December 14, 1994). "Max Bill, 85, Painter, Sculptor And Architect in Austere Style". New York Times. Retrieved April 24, 2015.

External links

This article is issued from Wikipedia - version of the 9/1/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.