F(n) = F(n-1) + F(n-2)

F(n) = F(n-1) + F(n-2)

640 x 120 cms

Blood on drywall

Representation of the algorithm f(n) = f (n-1) + f (n-2) to calculate the Fibonacci sequence. One unit is equivalent to one centimeter of the graph. As a consequence, the visualization of this function takes up considerable space. Only the first fifteen positions occupy more than six meters of surface, generating reflection on the perception of digital dimensions versus physical ones.

Bitnami