Skip to content

The Speed of Communication

August 14, 2012

Fifty years of acceleration


Kurt Gödel has been keeping a low profile recently. It’s not in his nature to distract from all of the celebrations of Alan Turing these past months, especially when he never met the man. Plus he can only communicate via time-traveling neutrinos, which CERN explained last February do not exist—the exciting superluminal measurements were artifacts of a loose cable. That dried up our funding before we could transcribe the second part of our interview, though as a result of this post we may have found an anonymous donor. It is hard to show continued progress when your working setup has been proved theoretically impossible, but that doesn’t stop cryptanalysts and it won’t stop us.

Today we present a communication to Gödel that he obtained by simpler means, and reflect on changes in research communication over just half a century—rather, a quarter-century.

The Rare Books and Special Collections department of Princeton’s Firestone Library has many boxes of Kurt Gödel’s correspondence and other writing and memorabilia. Most of the rest is in Vienna. One can in fact browse the catalog of Firestone’s Gödel holdings online, in commendably copious detail.

I (Ken) had the pleasure of looking through just a small portion of these materials while visiting Princeton in February. Here is my transcription of a letter by mathematician Willaim Boone of UIUC to Gödel on May 18, 1959, telling him of developments by Pyotr Novikov on William Burnside’s conjecture, which we covered last November, including also work on it by Marshall Hall, Jr. Also named are Warren Hirsch, whose conjecture we have also covered, John Thompson whom we mentioned here, and Andrzej Mostowski.

1959: News By Surface Letter

Bill Boone to Kurt Gödel, May 18, 1959—I did not note down the exact salutation, and it is not allowed to make photocopies of materials except by special permission.

Just wanted to tell you the big news that Novikov has settled the Burnside problem. (He so wrote Hirsch, who wrote Marshall Hall, Jr., who wrote a young man named Thompson at Chicago U., who wrote me!) Novikov says that the free group on two generators with the condition added that the Nth power of each element equals the identity, N ≥ 72, is ALWAYS an infinite group.

I have written Hirsch for details & will write Novikov shortly.

It would seem doubtful to me now that at this late date I could manage to get to the Warsaw meeting—however, I’ve written to John Addison to find out if it is a closed meeting. If it is not, I’ll write Mostowski directly—hopefully while he is still in the States.

Boone ended his letter by talking about some papers on the word problem for groups that he was reviewing.

Another letter from Boone was addressed “Dear Professor” and included a greeting to “Mrs. Gödel” with the umlaut hand-written in. He then gave the timeless plaint that “… my only trouble these days is that I seem so busy with classes that it is a struggle to get adequate time for research.” His very next sentence got to the point: “Given an arbitrary recursively enumerable degree of unsolvability…”

Of course, many scientific journals began by organizing the earlier system of private letters among members of research societies, and some even retain the word “Letters” in their title.

Whoops, Make that 1968

The details that Boone wrote for, alas, took almost a decade to arrive. If this mathematical announcement was like a promissory note, then the owed value after 9 years’ maturity can be said to have mushroomed from {N = 72} to {N = 4,381} in 1968. According to this history,

Novikov’s argument of 1959 was correct in general terms but the details were not, and in putting the arguments right it was found that one required larger values of N.

The fix required the help of his colleague Sergei Adian, and as we quote from Wikipedia’s biography of Adian, took more than Novikov to make the appeal:

…the concrete realization of [Novikov’s] ideas encountered serious difficulties, and in 1960, at the insistence of Novikov and his wife Lyudmila Keldysh, Adian settled down to work on the Burnside problem. Completing the project took intensive efforts from both collaborators in the course of eight years.

Another decade later Novikov and Adian paid it down to N = 665, and as we related here, it has come down to N = 115. Actually all these are resolutions only among odd exponents—for even exponents the going rate is N = {2^{48}} = 281,474,976,710,656, but only among exponents that are multiples of 512. Adian also found a tragic one-line error in a 300-page attempted proof by John Britton.

Incidentally, Adian was later the PhD advisor of Alexander Razborov.

1984: Still Nothing Orwellian

E-mail was still unknown to me at Oxford in 1984—I recently told a story about being slow to communicate some research by surface mail. Only a few universities subscribed to the ARPANET, which is considered to have been the main precursor to the Internet. I did not use e-mail or newsgroups until starting a postdoc at Cornell in October 1986. Thus halfway through our 50-year period things were much the same.

1989: Interactive Proof Frenzy

The complexity characterization of interactive proofs was a landmark not only for complexity theory but also for the research use of e-mail. What the New York Times called a frenzy of e-mails not only communicated results about {\mathsf{IP}} but led to the optimal form {\mathsf{IP} = \mathsf{PSPACE}}. One of the spurs was Seinosuke Toda’s proof the year before that the polynomial hierarchy reduces to counting, which I learned the spring before meeting him at the Structure in Complexity 1989 conference in Eugene, Oregon.

László Babai tells much of the story in his article “E-mail and the Unexpected Power of Interaction,” as does Ryan O’Donnell in his class notes, “A history of the PCP Theorem” drawing from Babai. The communications began on Nov. 27, 1989, when Noam Nisan announced to a few friends that the permanent has a multiple-prover interactive proof. Among them Lance Fortnow started a line of inquiry on getting this down to a single prover. He announced on Dec. 13, 1989 the breakthrough—mostly by Carsten Lund as first author and joint with him, Howard Karloff, and Nisan—showing that the polynomial hierarchy is contained in {\mathsf{IP}}. The attached draft paper—until then mostly a local Chicago product—gave the first interactive protocol essentially using a non-constant number of rounds. About the ensuing race to improve the result, Babai writes:

I don’t know how many people began feverishly working on this problem with the keen sense that there would be just one winner: the one who first announces the (hopeful) result on e-mail.

That announcement would instantly kill all the competition. There are indications that a dozen may be a modest underestimate. Of the losers of the race, only those who achieved worthwhile by-products revealed themselves publicly.

The announcement came 13 days later, from Adi Shamir eight time zones away in Israel. This led to some hard feelings in Chicago, and Babai discusses some of the attendant ethical issues arising from both the scope of the group given the information and the speed of the medium.

Although such elite groups belong to the very nature of the hierarchy of scientific research (and the elites in question are among the most tolerant and open bunches in history…), their sheer intellectual force combined with the information advantage makes them look from outside like an impenetrable fortress. Among those who did not receive any of the mailings were Toda, Razborov, all of East Europe, …

Nor I. I learned about this after New Year’s, and about further developments later from my wife, an English teacher. She learned about them from her college roommate, a lawyer. Who soon married the Chicago theorist and former MIT office-mate of Lance’s she’d heard them from. But if blogs and/or arXiv had existed then, Lance might have communicated the draft that way, and the whole world would have been equal. Co-incidentally someone whose work on testing for the permanent is noted by both Babai and O’Donnell as partly instigating Nisan was also trying to get others excited for more applications of the idea, and would have loved a blog platform to do so—which he started 20 years later, in 2009.

There were of course other by-products, not only the two-prover characterization of {\mathsf{NEXP}} but insights leading to PCP’s and beyond, and these came from both Chicago and a wide swath of the community.

1999: Internet Interaction

I was, however, in the loop of what Michael Nielsen regards as the first signature example of massive on-line research collaboration, the 1999 Kasparov Versus the World Internet Chess Match. It is a main running example in his new book Reinventing Discovery: the New Era of Networked Science. Well, quite possibly I caused the World to lose the game.

With sponsorship from Microsoft and First USA Bank, the match began in June 1999. The MSN Gaming Zone implementation permitted anyone (freely registered) to vote in a 24-hour period among moves recommended by four teenage masters, Étienne Bacrot of France, Florin Felecan of Romania and the US, Irina Krush of the US, and Elisabeth Pähtz of Germany. Importantly it included a bulletin board on which everyone could debate the moves and discuss anything. The move with a plurality of votes was executed, and World Champion Garry Kasparov had 24 hours to respond with his move. This alternated for what (based on previous games of this kind) was expected to be 30–40 moves and a rout by Kasparov ending in August. Instead it lasted 62 thrilling moves through October and not only drew more worldwide attention and participation than ever expected, but also impacted Kasparov’s preparation for his title defense, which was postponed and became a fateful loss to Vladimir Kramnik in 2000.

I knew about the game’s existence, but I’ve avoided online chess and was at the height of ideas for lower-bounding the permanent which we recently included here. One of my students on this project kept pumping me to look, and in late July or early August I finally did. I found that Krush was being managed by one of my childhood chess friends, Ron Henley—and to my dismay that Henley was being flamed on the MSN message boards amid general foulness. So I stepped in with a post appealing for perspective on how fascinating the endgame Krush had recommended entering was, and thereupon was hooked.

This endgame produced one of the most exciting events in chess, a multiple-pawn Queening race. I recognized that the looming position at Move 51 had even greater complexity despite having only 7 pieces, and called for organized analysis beyond any one person. It has Kasparov, playing White, to move:

Accordingly I spent a 36-hour day writing and posting a guide to the strategies. The last of my 30 bullets laid out how to organize and conduct the research. Alas my strategy bullet (11) recommended a kind of Pawn sacrifice that was followed at Move 54 but has now been proven to be the losing move, leaving us in need of traps.

We did in fact get fantastic contributions from amateur players, with pages of good analysis gathered and posted by Irina’s sponsor, SmartChess Online. The best one was a trap we were laying at Move 65 for Kasparov. However it was forestalled by a communications breakdown that prevented Irina’s crucial Move 58 recommendation from being posted at MSN, and a skin-deep alternative causing defeat four moves later was voted in. In an Orwellian turn, we had stopped talking about this trap on the BBS and kept silent on its correctness—later verified by exhaustive computer tabulation—out of paranoia that turned out to be justified: Kasparov later admitted that he was eavesdropping on the BBS. (I cut Kasparov slack on that because there should have been a stipulation from the start that masters above the 2300 level of the junior panelists could not discuss moves, while he was facing teams of grandmasters including one in St. Petersburg, Russia, long before I came on the scene.)

I am glad he thought the World’s research was valuable. There is much more I could tell even besides my articles with Irina and the book by Kasparov, but it will have to be another time.

2009: Blogs and PolyMath

Nielsen went on to aid the PolyMath Project which sprang from a 2009 blog post by Timothy Gowers.

This chapter is still being written, and we should leave it to you the readers to evaluate the effectiveness of this medium, for spurring research not just communicating it. On our part, besides this week being the two-year anniversary of the world-wide review in blog comments of Vinay Deolalikar’s still un-disposed claim to have proved {\mathsf{P} \neq \mathsf{NP}}, we have hosted a longrunning debate on the scalability of quantum computers, and just now had some research discussion of a new way to solve linear equations.

Open Problems

How well do our brains keep up with this speed—and fanout? What might be better about research by letter?

[fixed link and my early-1990 recollection(?)]

8 Comments leave one →
  1. August 14, 2012 10:33 pm

    Was the term “PCP” used in 1990? My memory may be a bit rusty. The NY Times article came on June 26, 1990, five days after FOCS acceptance which validated the papers, and quotes Donald Beaver for “some kind of probabilistic proof system”. The term “transparent proof” comes from Babai-Fortnow-Lund-Szegedy which was STOC’91.

    The sequence from the chess diagram was 51.Qh7 b5(?!) 52. Kf6+ Kb2(?!) 53. Qh2+ Ka1 54. Qf4 b4(?) 55. Qxb4 Qf3+ 56. Kg7 d5 57. Qd4+ Kb1 58.g6, and now the poor move 58…Qe4? was voted instead of the Team’s 58…Qf5!, which intends 59.Kh6 Qe6 and now what does White do? Well a week earlier a so-called Zugzwang idea came to me in the shower: 60.Qg1+ (or Qd1+) Kb2 61. Qf2+ (or Qd2+) Kb1 62.Qd4!! which looks like time-wasting but forces Black to make an injurious move. I raced to our basement computer to see if anyone else had noted it, and finding none, posted it.

    Kasparov felt strongly enough that he and Grandmaster Boris Alterman released in late October a 13-page analysis claiming to prove a win even after 58…Qf5 via the Zugzwang idea, but I found a gap at their point labeled “G”, and proved it a draw by non-aided analysis later upheld by computer. However, the same computer tabulation found a win after our envisioned 62…Ka2 reply that we all missed, and Kasparov gives it without further comment in his book.

    I was suspecting a different win, which was also proved valid, and was on the point of advocating playing for the trap with 62…Kc2 instead. That runs 63.Kg5 Qe7+ 64.Qf6 Qe3+, and now Kasparov’s analysis file—which followed what we released quasi-verbatim on this page—shows clear intent to play 65.Kg4 which is marked with a “!” This expected 65…Qg1+ 66.Kf5 d4 67.g7 d3 68.Qc6+ Kd2 69.Qg6 Qc5+ 70.Ke4 to win, but you can find the shocking missing move by going to the K4IT endgame server and entering the position manually or pasting in the FEN code 8/6P1/6Q1/2q5/4K3/3p4/3k4/8 b – – 0 1 Black holds after White makes a second queen the next move, even though computers show White with a winning advantage for many, many moves ahead! This was found by a player rated around 1950; I’d be glad to know if someone recalls the name (Ross?). My two sites (old= …/chess/GK-ROW/ and new= …/chess/K-W/) are a bit of a mess, don’t know when I’ll have time to finish them…

  2. Bill Gasarch permalink
    August 15, 2012 3:42 pm

    The Pros of fast communication, and open comunication are obvious- scientists can use
    each others results much faster, thus normal science progresses much faster.
    By Normal Science I mean, as Kuhn did, science where we all agree on the paradigm.

    For breakthroughs and thinking-outside-of-the-box the results might be mixed.
    (1) It might be the case that we are so busy keeping up that we are not sitting
    down and doing the hard work needed to solve really big problems or ask new
    questions. I’ve heard this said, but I am not sure I buy it since some people can do
    both and some people will just not fall into this trap.

    (2) I”ve heard it said (and I would be happy to be corrected) that Kachian’s LP algorithm
    came out of a diff school of thought (russian) than the americans and others were working on. Now that we are all connected we are all in the same school of thought. Might there be a problem with group think?

    Is the gain worth the loss? Even though I bring up some problems, I think it is.
    I just hope there are people working on new things and not sucked into the group think.

    • August 16, 2012 4:49 am

      For that one need (1) an independent way of obtaining knowledge, e.g. guided “wikipedia” and (2) tolerant group think that is helpful in extracting the essence and creating guided “wikipedia” (think of small perceptual units of information supported by the small problem sets linked together to reach the specified goal). By the way, this is different mode of scientific operation – infinitesimal advances in the public interest – more like open source software, even more than polymath, which in practice required traditionally educated agents, limiting participation.

  3. Frank Vega permalink
    August 17, 2012 8:18 am

    A paper has been published about P versus NP in IEEE-AL. Follow the arguments in my blog with some comments for dummies and the corresponding links of the published paper and the preprint(in spanish and english):

    • could happen... permalink
      August 23, 2012 12:20 am

      Some of the randomly generated CS papers (generated by SciGen) got also accepted at IEEE conferences…

      • September 3, 2012 10:56 am

        I heard a lot of phrases such like that. I think I got used to hear them. I bet for valid arguments instead, I think is more wise and human than your pessimistic and sterile way: which is very common.


  1. Ten Years of Blog Complexity « Gödel’s Lost Letter and P=NP
  2. More Interview With Kurt Gödel « Gödel’s Lost Letter and P=NP

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s