Computational Complexity

 

Creative Commons License
This work is licensed under a Creative Commons License.

Powered by Blogger™

Thursday, August 02, 2007

 
This is the 1000th post !

Posted by GASARCH

This is the 1000th posting on the complexity blogs. 958 were when Lance was running it and the rest (I'll let you do the math) were when I was running it. This is not an exact count of how many postings we made since there were many guest posts.

SO, how to celebrate? I request that readers comment on their favorite and/or least favorite postings of either Lance or I.

I'll start: my favorite posting of Lance's was on how fields tend to view themselves as NOT being in a golden age: here it is

My least favorite was Lance's fairwell post. Not quite fair- it was a fine post, but I didn't like that he was stepping down.

~

5:45 PM #

  1. Anonymous Anonymous says:  
    It's spelt farewell, not fairwell.

  2. Anonymous Anonymous says:  
    It's also spelled "spelled," not "spelt." ;)

  3. Anonymous Eldar says:  
    I will not point a particular one, but several. I really liked Lance's "meta-academic" posts aimed mostly at beginning researchers, such as picking an adviser, choosing questions to work on, and quite a few others. They really are a valuable and rare service.

  4. Anonymous Anonymous says:  
    To anon 2: In British English, it is spelt "spelt".See the first line of:

    http://en.wikipedia.org/wiki/Spelt

  5. Anonymous Anonymous says:  
    To anon4: But this is an American Blog.

  6. Anonymous Anonymous says:  
    It's interesting to note that the blog can still be reached using weblog.fortnow.com. Isn't it time that it changed to weblog.gasarch.com?

    Or perhaps to WEBLOG.GASARCH.COM or to weblog.billg.com (in fact, if you choose the latter, a certain billionaire might also be interested in your blog)

  7. Anonymous Aaron Sterling says:  
    My favorite posts are ones that produced fascinating comments. (Perhaps we can get this particular post in the running?)

    The recent comment by Damien Woods on the importance of studying small Turing machines, and Sanjeev Arora's comments demystifying the PC STOC/FOCS process (which appeared in *that* post) are among my favorites. I also really appreciate the link to Parberry's advice on how to write and present.

    It's the end of the summer, so I suppose we can't expect much intellectual activity beyond proofreading for another couple weeks.

    However, if we didn't have the "lazy days of summer" excuse, I would be worried. If this is truly the level at which the readers of this blog approach this subject, it's no surprise research "areas" are so fragile they stand or fall based on the exact date the proofs of results are released.

  8. Anonymous Anonymous says:  
    ...it's no surprise research "areas" are so fragile they stand or fall based on the exact date the proofs of results are released.

    Huh?

Comment Feeds: This Post All

Links to this post:

Weblog Home

Archives