Incomplete Falling Trees - Part 2/3

This small series of Incomplete Falling Trees, fully coded in Processing, is dedicated to Gödel's First Incompleteness Theorem, which roughly claims that 'there are truths that cannot be formally proved' (the presice statement in inscribed in the artwork itself).

Gödel brilliant proof rests on a self-referencing formula G that speaks about itself and says 'G is not provable in any consistent formal system'. The sentence is true but unprovable.

Also this artwork is self-referencing, since its generating code is graven into the artwork itself. The artwork's DNA is part of the artwork generated with the DNA. The artwork is naked, it has no hidden secret. You can use the printed code and generate precisely the same artwork, or almost. Since the code uses randomness, the outcome will be most likely slightly different. Incomplete Falling Trees is in fact a generating machine of Incomplete Falling Trees.