News for hackers. Stuff that matters.
Re:Graham's Number by CurtMonash on Sunday February 15, 2015 @06:08PM (#9054564)
It seems like the real character here is Graham, who I've never met, but I do have a story about his collaborator Bruce Rothschild, who was my professor for junior-level linear algebra.

In those days, you either gave your professors little self-addressed stamped postcards to tell you your grade, or went to their offices to ask them. I took the latter approach with Rothschild. "What grade were you expecting?", he replied. I confessed that I thought I would probably get an A. "You're getting an F", he said. "I'm giving everybody the opposite of what they expect."

Re:Graham's Number by formalsystem on Sunday February 15, 2015 @07:17PM (#9054725)
I TA'd for Graham's Discrete math class at UCSD. He's still quite the character! His last lecture he juggled a handful of chalks in class and brought his deck of cards to do magic tricks.

He once made me pull out a 1$ bill from my pocket in his office and then asked me what the serial number was, he shot out a question like: "what's the probability that you have n consecutive numbers on the bill".

You could tell Math was legitimately fun for him, he treated open math problems like brain teasers and that fun rubbed off on the people around him as well.

Re:Graham's Number by teejae on Sunday February 15, 2015 @07:36PM (#9054778)
You were playing Liar's Poker.
Re:Graham's Number by formalsystem on Sunday February 15, 2015 @07:41PM (#9054793)
He probably played it differently from most people though

http://quant.stackexchange.com/questions/4201/strategies-for...

Re:Graham's Number by pmelendez on Sunday February 15, 2015 @07:18PM (#9054727)
Was he joking?
Re:Graham's Number by CurtMonash on Sunday February 15, 2015 @09:37PM (#9055072)
Yes. Anything else would have been ... problematic.
Re:Graham's Number by ars on Sunday February 15, 2015 @10:33PM (#9055195)
You should have told him "I expected you to say that" and let infinite recursion reign free. :)
Re:Graham's Number by CurtMonash on Monday February 16, 2015 @06:08AM (#9056287)
No, that's something to do in a Hilary Putnam philosophy class. He's the one who announces at the beginning of the term there will be a two-part final:

A. Write a question suitable for this course. B. Answer it. You will be graded on both parts.

Re:Graham's Number by formalsystem on Sunday February 15, 2015 @07:35PM (#9054774)
He wasn't serious but he would have been interested in a quick answer. I didn't get it cause I couldn't think of a quick way to know what a reasonable upper bound for the serial number is (I believe they're printed sequentially). To be fair the guy spent his whole career learning how to count things!
Re:Graham's Number by ctdonath on Sunday February 15, 2015 @06:16PM (#9054591)
Here's an excellent and brain melting expose of Graham's Number: http://waitbutwhy.com/2014/11/1000000-grahams-number.html
Re:Graham's Number by shurcooL on Sunday February 15, 2015 @08:32PM (#9054911)
Thanks for finding it and linking. That has got to be one of the most entertaining (and educational) math articles that anyone can read/understand.

Some of my favorite parts (minor spoilers):

> Look closely at that drawing until you realize how not okay it is. Then let’s continue.

> Then Graham decides that for g2, he’ll just do the same thing as he did in g1, except instead of four arrows, there would be NO I CAN’T EVEN arrows.

Re:Graham's Number by prezjordan on Sunday February 15, 2015 @05:45PM (#9054482)
My brain melts every time I watch this video [1] from Numberphile on Graham's number.

They also had another video [2] with Ron Graham himself :)

[1]: https://www.youtube.com/watch?v=XTeJ64KD5cg [2]: https://www.youtube.com/watch?v=GuigptwlVHo

Re:Graham's Number by torthrw on Sunday February 15, 2015 @06:32PM (#9054645)
Nothing really trumps this article on big numbers. http://www.scottaaronson.com/writings/bignumbers.html
Re:Graham's Number by a3_nm on Monday February 16, 2015 @02:18AM (#9055732)
There was a contest to write the 512-char C program that generated the largest number (but still terminates), assuming that all integer types are unbounded: http://djm.cc/bignum-results.txt

The method used by the winning entry is extremely interesting: return the outputs of all possible programs up to a certain size which terminate according to the calculus of constructions. It's quite crazy to have done this in 512 chars.

Re:Graham's Number by foklepoint on Sunday February 15, 2015 @08:56PM (#9054973)
Graham is the coolest UCSD professor I have ever had a conversation with. I remember a particular instance, at the beginning of my first quarter at UCSD. I wasn't familiar with his work and had never heard of him. My naive 19 year old self walked into his office hours asking some simple probability question. I noticed a cast on his hand and inquired about it. He jokingly said he got a cut because he was juggling ice skates. I thought he was joking. I went home and looked him up, only to find that he was the head of the national jugglers association at one point. Pretty awesome guy.
Re:Graham's Number by simoncarter on Sunday February 15, 2015 @06:12PM (#9054576)
Before clicking on the link, I thought for some reason this would be article explaining how Paul Graham had got his own number, much like the Erdos number http://en.wikipedia.org/wiki/Paul_Erd%C5%91s#Erd.C5.91s_numb....
Re:Graham's Number by nevdka on Sunday February 15, 2015 @06:30PM (#9054635)
How many steps removed are you from starting a company with Paul Graham...
Re:Graham's Number by ikeboy on Sunday February 15, 2015 @07:35PM (#9054777)
I read hacker news, so 1?
Re:Graham's Number by Ronsenshi on Monday February 16, 2015 @03:51AM (#9055923)
I love this video http://www.youtube.com/watch?v=1N6cOC2P8fQ by Sean Day[9] Plott describing Graham's number very well. At least I found that description very easy to follow. Numberphile [1] too has a great explanation, but I still strongly recommend watching Day[9] video because it tells a little bit of history and Sean is very expressive and good speaker so he easily engages viewer.

[1] https://www.youtube.com/watch?v=XTeJ64KD5cg

Re:Graham's Number by leni536 on Monday February 16, 2015 @04:31AM (#9056003)
I think fast growing functions could be interesting as well. My favorite example is the "busy beaver function"[1]. It has been shown that it grows faster asymptotically than any computable function, where computability roughly means that you can write an algorithm to calculate its value (without memory or running time constrains).

Note that the Graham number can be written as G=f[64](4), where [.] means the number of iterations of f and f(4)=3\up\up\up\up3 (as in the article). Now you can define a function g(n) as g(n):=f[n](4), so G=g(64). g is computable since we just described an algorithm to calculates its values. So the busy beaver grows even faster (asymptotically) than g.

[1] http://en.wikipedia.org/wiki/Busy_beaver

Re:Graham's Number by excalq on Sunday February 15, 2015 @10:29PM (#9055180)
Related to that is Tetration, which can be expressed with complex numbers resulting in some beautiful fractal graphs: https://en.wikipedia.org/wiki/Tetration#Extensions
Re:Graham's Number by markrages on Sunday February 15, 2015 @07:33PM (#9054766)
Mentioned in xkcd: http://xkcd.com/207/
Re:Graham's Number by thret on Sunday February 15, 2015 @10:22PM (#9055160)
Now I'm horrified too.
Re:Graham's Number by to3m on Sunday February 15, 2015 @10:26PM (#9055170)
Interesting that they feel the need to specify which problem this number is an upper bound for...
Re:Graham's Number by noobermin on Sunday February 15, 2015 @06:35PM (#9054649)
"[T]he observable universe is far too small to contain an ordinary digital representation of Graham's number, assuming that each digit occupies one Planck volume."

Sheesh.