Tupper's Self-Referential Formula

Self-Referential Formula.jpeg

Tupper's Self-Referential Formula is an equation that, when graphed, displays the formula itself. Here's the equation (same as the image of the output shown at the beginning of this post):

equation1.gif

Check out the link for the specifics of the functions and values of the variables.

(Via kottke)

Posted by | Jan 25, 2007 07:04 AM
Math | Permalink | Comments (5) Bookmark and Share

Recent Entries

Comments

Newest comments listed first.

Posted by: Wilberforce on February 1, 2007 at 8:25 AM

To me, this is no less amazing than tuning your television to an empty channel and finding a schematic of how to build the television depicted in the static. I tried to explain this to my wife a few times, but I just get blank stares after a while.

Of course, I have no way to test if this is true, or if this is some joke that would make milk come out of mathematician's nose, but I gathered from some other sources I found on the web that it is.

The fact that someone would find this odd equation and happen to graph it over such an odd range of numbers seems astronomically improbable. What are 105 and 9.609... *10^453 doing running around together? I'd say 105 is dating waaaaay out of his league.

Over the weekend I started thinking about this and figured that Tupper couldn't have just stumbled across this; it has to be "manufactured."

For one thing, 9.609*10^453 (which I'm going to call 'n' from now on) does not look like a random number to me (as ridiculous as that sounds. I mean, what number isn't random at some point in time?). n seems to contain too many stretches of repeating digits for it to be just any old number. To me it just seems suspicious.

If you want to figure this out on your own, stop reading now.

To test my theory, I busted out the Java BigInteger class and converted n to binary. Sure enough, taken 17 bits at a time, n looks a lot like the graph of Tupper's Self-Referential Formula. In fact 106*17 (the size of the graph) is 1,802, which is exactly the number of binary digits it takes to represent n. Dividing n by 17, converting it to binary, and arranging the bits in columns of 17 bits each yields Tupper's formula exactly. What Tupper did was develop a formula that converts y into its binary representation and then constructed n such that it represented the formula itself - sort of like dot-matrix printing in reverse.

I still think this is pretty dang clever, but before I understood how it worked I thought it was nothing short of mystical.


Posted by: James G. on March 14, 2008 at 7:23 AM

Re: Comment By Wilberforce

Great explenation! Amazingly behind your sarcastic remark, the way you were able to explain how you came up with the way the equation works, to print itself, is great. Thanks for your wonderful interjection, hopefully you get to read my responce.


Posted by: KPSS Matematik on July 9, 2008 at 9:38 AM

Kpss Matematik

This is great issue. thank you


Posted by: Web Design Company USA on August 18, 2008 at 6:02 AM

Re: Comment By Wilberforce

Nice insight :)


Posted by: Web Design Company USA on August 18, 2008 at 6:13 AM

Re: Comment By Wilberforce

Nice insight :)


Leave a comment



Bloggers

Welcome to the Hacks Blog!

Brian Jepson.Brian Jepson


Jason Striegel.Jason Striegel


Philip Torrone.Phillip Torrone



See all of the books in the Hacks Series!
Advertise here.

Recent Posts

www.flickr.com
photos in Hacks More photos in Hacks