Thursday, February 26, 2004

Marriage and the Donald

›
A few interesting items from this week's Newsweek . Chicago Theory Ph.D. Amber Settle and quantum computing expert Andre Berthiaume ...

Fermat's Last Tango

›
While visiting Bill Gasarch in Maryland, he chose to show a tape of Fermat's Last Tango , an off-Broadway musical based loosely on Wiles...
2 comments:
Wednesday, February 25, 2004

Why the NSF Needs Your Grant Proposals

›
One of our graduate students asked me why, if the NSF has limited grant money, do our program officers actively and sometimes aggressively...
Tuesday, February 24, 2004

My Doom

›
Yesterday I got an email addressed from SUNY Stonybrook with a strange attachment. I checked it with a virus checker and then stupidly opene...
Sunday, February 22, 2004

Sneakers

›
Time for one of my complexity-related movie recommendations. The 1992 film Sneakers describes the adventures of a professional hacking te...
1 comment:
Friday, February 20, 2004

The LaTeX Generation

›
When I started college in 1981 I brought a typewriter with me. Junior year of college I experimented with a simple text processor system c...
Wednesday, February 18, 2004

Parberry's Guides

›
The most requested topic I get is for my advice for graduate students. So I would be remiss not to mention Ian Parberry's excellent gu...
Monday, February 16, 2004

And the Accepted Papers are ....

›
The closest thing this weblog has to the academy awards; the list of accepted papers of the upcoming Computational Complexity Conference i...
Sunday, February 15, 2004

Is it Recursive, Computable or Decidable?

›
Every reader of this weblog should know about the recursive and recursively enumerable (r.e.) sets, languages accepted by Turing machines wh...
2 comments:
Thursday, February 12, 2004

Journal of Algorithms Editorial Board Bolts to New ACM Journal

›
Michael Nielsen has a post linking to a post linking to a post noting that the editorial board of the Journal of Algorithms (publish...
Tuesday, February 10, 2004

Minimal Indices

›
Let's look at some interesting questions about the set of smallest programs. This post relates more to recursion theory than complexity...
Monday, February 09, 2004

The MIT-Berkeley Axis

›
"I like everybody in this field" Berkeley professor Christos Papadimitriou said during his acceptance speech of the Knuth Award ...
Saturday, February 07, 2004

Reading the Applications

›
I spent a considerable part of yesterday looking at applications for our Ph.D. program in theoretical computer science. Some of you readers...
3 comments:
Wednesday, February 04, 2004

Super Theory Day at Columbia on May 14

›
Editor's Note: I don't plan to be an announcement server but this theory day deserves some extra publicity. Despite the self-aggr...
Tuesday, February 03, 2004

Designing for Innovation

›
An interesting NSF press release describes the importance of the layout of offices to the productivity of a research group: Clustering it...
Monday, February 02, 2004

A letter from the editors of the journal Computational Complexity

›
Dear friends and colleagues, We would like to encourage you to submit suitable papers to the journal Computational Complexity (cc). ...
Friday, January 30, 2004

A Little Theorem

›
Here's a simple result I have seen several times recently, a bit surprising when you first see it. Theorem: co-NEXP is in NEXP/poly...
1 comment:
Wednesday, January 28, 2004

The Defense, Part II

›
Hein Röhrig successfully defended his Ph.D. thesis at the University of Amsterdam yesterday. The Dutch thesis defense reminds me most of a t...
Monday, January 26, 2004

Howdy from Amsterdam

›
I have returned to Amsterdam for the week. I did my sabbatical in Amsterdam seven years ago and I always enjoy the visit. Yesterday I saw ...
Friday, January 23, 2004

STOC and the NSF

›
A couple of quick notes. The list of accepted papers for the upcoming STOC conference has been posted. The most intriguing looking pape...