Tupper's self-referential formula


Tupper's self-referential formula is a formula that visually represents itself when graphed at a specific location in the plane.

History

The formula was defined by Jeff Tupper and appears as an example in Tupper's 2001 SIGGRAPH paper on reliable two-dimensional computer graphing algorithms.
This paper discusses methods related to the GrafEq formula-graphing program developed by Tupper.
Although the formula is called "self-referential", Tupper did not name it as such.

Formula

The formula is an inequality defined as:
or, as plaintext,
where ⌊ ⌋ denotes the floor function, and mod is the modulo operation.
Let k equal the following 543-digit integer:
If one graphs the set of points in 0 ≤ x < 106 and k ≤ y < k + 17 satisfying the inequality given above, the resulting graph looks like this :
The formula is a general-purpose method of decoding a bitmap stored in the constant k, and it could actually be used to draw any other image. When applied to the unbounded positive range 0 ≤ y, the formula tiles a vertical swath of the plane with a pattern that contains all possible 17-pixel-tall bitmaps. One horizontal slice of that infinite bitmap depicts the drawing formula itself, but this is not remarkable, since other slices depict all other possible formulae that might fit in a 17-pixel-tall bitmap. Tupper has created extended versions of his original formula that rule out all but one slice.
The constant k is a simple monochrome bitmap image of the formula treated as a binary number and multiplied by 17. If k is divided by 17, the least significant bit encodes the upper-right corner ; the 17 least significant bits encode the rightmost column of pixels; the next 17 least significant bits encode the 2nd-rightmost column, and so on.
It fundamentally describes a way to plot points on a two dimensional surface. The value of k is the binary number that forms the plot in base 10. The following plot demonstrates the addition of different values of k. In the fourth subplot the k value of "AFGP" and "Aesthetic Function Graph" are added to get the resultant graph, where both the texts can be seen. It is because the binary addition. The information regarding the shape of the plot is stored within k.