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 (x, y) 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.^[1] This paper discusses methods related to the GrafEq formula-graphing program developed by Tupper.^[2]

Although the formula is called "self-referential", Tupper did not name it as such.^[3]

Formula

The formula is an inequality defined as:

$${\displaystyle {\frac {1}{2}}<\left\lfloor \mathrm {mod} \left(\left\lfloor {\frac {y}{17}}\right\rfloor 2^{-17\lfloor x\rfloor -\mathrm {mod} \left(\lfloor y\rfloor ,17\right)},2\right)\right\rfloor }$$ where ${\displaystyle \lfloor \dots \rfloor }$ denotes the floor function, and mod is the modulo operation.

Plots

Let ${\displaystyle k}$ equal the following 543-digit integer:

960 939 379 918 958 884 971 672 962 127 852 754 715 004 339 660 129 306 651 505 519 271 702 802 395 266 424 689 642 842 174 350 718 121 267 153 782 770 623 355 993 237 280 874 144 307 891 325 963 941 337 723 487 857 735 749 823 926 629 715 517 173 716 995 165 232 890 538 221 612 403 238 855 866 184 013 235 585 136 048 828 693 337 902 491 454 229 288 667 081 096 184 496 091 705 183 454 067 827 731 551 705 405 381 627 380 967 602 565 625 016 981 482 083 418 783 163 849 115 590 225 610 003 652 351 370 343 874 461 848 378 737 238 198 224 849 863 465 033 159 410 054 974 700 593 138 339 226 497 249 461 751 545 728 366 702 369 745 461 014 655 997 933 798 537 483 143 786 841 806 593 422 227 898 388 722 980 000 748 404 719

Derivation of k

Graphing the set of points ${\displaystyle (x,y)}$ in ${\displaystyle 0\leq x<106}$ and ${\displaystyle k\leq y<k+17}$ which satisfy the formula, results in the following plot:^{[note 1]}

The formula is a general-purpose method of decoding a bitmap stored in the constant ${\displaystyle k}$, and it could be used to draw any other image. When applied to the unbounded positive range ${\displaystyle 0\leq 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.^[4]

The constant ${\displaystyle k}$ is a simple monochrome bitmap image of the formula treated as a binary number and multiplied by 17. If ${\displaystyle k}$ is divided by 17, the least significant bit encodes the upper-right corner ${\displaystyle (k,0)}$; 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 ${\displaystyle k}$ is the number whose binary digits form the plot. The following plot demonstrates the addition of different values of ${\displaystyle k}$. In the fourth subplot, the k-value of "AFGP" and "Aesthetic Function Graph" is added to get the resultant graph, where both texts can be seen with some distortion due to the effects of binary addition. The information regarding the shape of the plot is stored within ${\displaystyle k}$.^[5]

Addition of different values of k

See also

• Bitmap – Computing term
• Elementary function – Mathematical function
• Quine (computing) – Self-replicating program
• Recursion – Process of repeating items in a self-similar way
• Strange loop – Cyclic structure that goes through several levels in a hierarchical system

References

Footnotes

1. The axes in this plot have been reversed, otherwise the picture would be upside-down and mirrored.

Notes

1. • Tupper, Jeff. "Reliable Two-Dimensional Graphing Methods for Mathematical Formulae with Two Free Variables" Archived 2019-07-13 at the Wayback Machine
2. "Pedagoguery Software: GrafEq". www.peda.com. Archived from the original on 2021-02-24. Retrieved 2007-09-09.
3. Narayanan, Arvind. "Tupper's Self-Referential Formula Debunked". Archived from the original on 24 April 2015. Retrieved 20 February 2015.
4. "Selfplot directory". Pedagoguery Software. Retrieved 2022-01-15.
5. "Tupper's-Function". Github. Aesthetic Function Graphposting. 2019-06-13. Retrieved 2019-07-07.

Sources

• Weisstein, Eric W. "Tupper's Self-Referential Formula." From MathWorld—A Wolfram Web Resource. Archived 2021-02-05 at the Wayback Machine
• Bailey, D. H.; Borwein, J. M.; Calkin, N. J.; Girgensohn, R.; Luke, D. R.; and Moll, V. H. Experimental Mathematics in Action. Natick, MA: A. K. Peters, p. 289, 2006. Archived 2016-12-21 at the Wayback Machine
• "Self-Answering Problems." Math. Horizons 13, No. 4, 19, April 2006
• Wagon, S. Problem 14 in stanwagon.com Archived 2007-02-02 at the Wayback Machine

External links

• Jeff Tupper's official website
• Extensions of Tupper's original self-referential formula
• Tupper's self-referential formula in Rosetta Code, implementation in several programming languages
• TupperPlot, an implementation in JavaScript
• Tupper self referential formula, an implementation in Python
• The Library of Babel function, a detailed explanation of the workings of Tupper's self-referential formula
• Tupper's Formula Tools, an implementation in JavaScript
• Trávník's formula that draws itself close to the origin
• A video explaining the formula