6 ms·
At 63, Israeli immigrant solves 38-year-old math riddle
- deleted 19y ago[deleted]
- anon 19y ago
- mechanical_fish 19y agoThis guy helps illustrate my theory of why hackers and mathematicians have a reputation for being young. First: Because both math and software don't require expensive equipment, credentials, or direct access to one's mentors (like Ramanujan, you can learn from books!) you can start your training as a mathematician at a very early age and be doing professional-grade work before you graduate high school. As I said the last time this came up, "software is one of the few fields where a seventeen-year-old can have ten years of pro-level experience". Second: Mathematicians who want to get jobs in academia have large incentives to do good work when they're young: Until they make a splash, they're poorly paid grad students and postdocs. This is also true for other scientists, but in physics or biology you have to be in grad school before you can even get a long-term job in the lab where you can start learning to do great experimental work -- and then you still have to take reams of data, do multiple postdocs, etc. By the time they hit age fifty, most talented mathematicians have already accomplished some math. They have jobs, and possibly tenure. They have children, they have committee meetings, they have books to write. They have already proven themselves. Even if they do accomplish some great math papers, you won't see headlines about "astoundingly old mathematicians". They'll be billed as "veteran math professors", whom everyone expects to do great work, since they've been doing great work ever since they were twenty! But then there's this poor guy, who somehow arrived in his forties and fifties without tenure or even a job. That was unpleasant for him, of course, but it gave him a lot of incentive to do some great mathematics in order to get and keep a new academic job. And, what do you know, he rose to the occasion. Perhaps if more sixty-year-olds had good reason to do great math, we would see more of them doing so.
- whacked_new 19y agoThere was actually formal research done on this topic; IIRC, the results are generally as you said.
- mechanical_fish 19y agoThanks. I did not know that! If I were younger and looking for a job in sociology, maybe I would have done some of that formal research instead of posting half-assed speculation on news.yc. :)
- anon 19y ago" job in sociology," lol
- aflag 19y agoDoes you or anyone have links for articles about that research?
- whacked_new 19y agoI think this is the one I saw many years ago. http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6WM0-47S6KSS-7&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=b2d6a77f5d20c526d27ce73f758dedf2 http://www.sciencedirect.com/science?_ob=ArticleURL&_udi... It isn't exactly as mechanical_fish says, but it's along the same lines, and critically, it tries to explain why scientific contributions fade dramatically after marriage. Another interesting article, while doesn't count as research, likely because there isn't much of a sample size, and probably wouldn't be one anymore, is the Richard Hamming talk pg posted here: http://www.paulgraham.com/hamming.html http://www.paulgraham.com/hamming.html After these inputs, a valid hypothesis is "monotony kills creativity." There are studies that show this idea is generally correct; if you ask, the ones I would cite to support this hypothesis would be ones about education, where stimulating environments correlate to achievement. Research in this area should be easy to find.
- vegashacker 19y agoHere's the link to the paper: http://arxiv.org/abs/0709.0099?loc=interstitialskip http://arxiv.org/abs/0709.0099?loc=interstitialskip It's just 9 pages long, including an intro and bibliography.
- Raphael 19y agoThis is a riddle? Just work outward; Each of the destination's adjacent nodes point to it, and recursion does the rest.
- jcl 19y agoRead the Wikipedia description: http://en.wikipedia.org/wiki/Road_coloring_problem http://en.wikipedia.org/wiki/Road_coloring_problem You can't "point" nodes at each other to communicate the directions to the destination. Instead, you must communicate by coloring each edge with one of k colors (k is the out-degree of every node). Then, for any chosen destination node, you give a sequence of colors; the recipient of the directions starts in any node (even the destination node) and simply follows the sequence of colors, ending up at the destination. The fact that such a coloring always exists is somewhat surprising.
- anon 19y agoyou could use this to successfully and anonymously route packets through a ring of trusted and untrusted peers .