Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Artistic Practices: Visual Timeline and Installations

Description

This lecture presents a visual timeline showcasing artworks by Felix Gonzalez-Torres and Guy de Cointet, exploring themes of identity, memory, and cultural heritage. It also delves into installations by Susan Hiller and Iannis Xenakis, focusing on sound and visual complexity.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Related concepts (32)

Complexity class

In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.

Installation art

Installation art is an artistic genre of three-dimensional works that are often site-specific and designed to transform the perception of a space. Generally, the term is applied to interior spaces, whereas exterior interventions are often called public art, land art or art intervention; however, the boundaries between these terms overlap. Installation art can be either temporary or permanent. Installation artworks have been constructed in exhibition spaces such as museums and galleries, as well as public and private spaces.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Sound art

Sound art is an artistic activity in which sound is utilized as a primary medium or material. Like many genres of contemporary art, sound art may be interdisciplinary in nature, or be used in hybrid forms. According to Brandon LaBelle, sound art as a practice "harnesses, describes, analyzes, performs, and interrogates the condition of sound and the process by which it operates." In Western art, early examples include Luigi Russolo's Intonarumori or noise intoners (1913), and subsequent experiments by dadaists, surrealists, the Situationist International, and in Fluxus events and other Happenings.

NP (complexity)

In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems. NP is the set of decision problems for which the problem instances, where the answer is "yes", have proofs verifiable in polynomial time by a deterministic Turing machine, or alternatively the set of problems that can be solved in polynomial time by a nondeterministic Turing machine. NP is the set of decision problems solvable in polynomial time by a nondeterministic Turing machine.

Related lectures (29)

Linear Systems: Convergence and Methods

Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.

Transition to Smart Cities: Complexity and Interdependencies MOOC: Smart Cities, Management of Smart Urban Infrastructures

Delves into the complexity and interdependencies of transitioning to smart cities, emphasizing the importance of a holistic approach.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Algorithmic Complexity: Travel Time Analysis

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Algorithmic Complexity: Definition and Examples