Communications of the ACM
Refine your search:
How the “Frontier” Became the Slogan of Uncontrolled AI
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration …
From Computational Complexity
Lets Prove Something instead of proving that we can't prove something
We complexity theorists seem more concerned with proving that we can't prove things than with actually proving things!!!! There have been two workshop on Barriers...
From Computational Complexity
SIGACT Awards
ACM announced the following awards recently. Note that some of the awards are named after theorists and some awards went to theorists. Any comments on theirhere...
From Computational Complexity
Book Review Column AND request for reviews
A while back I posted a list of books that I need reviews for my column in SIGACT NEWS. This was legitimate--- I really did want reviewers--- but it was also an...
From Computational Complexity
Turning down a Fields Medal is eccentric, turning down the Millennium Prize is INSANE!
NEWS on Poincare Conjecture: Recall that Perelman was given the Fields Medal in 2006 for proving the Poincare Conjecture. He declined the award. Recent news...
From Computational Complexity
Stoc Travel Support/WELCOME BACK LANCE!
(REMINDER AND UPDATE: If you are a a grad student you can apply for travel support for STOC 2010. See here for details. One update on that: since registration and...
From Computational Complexity
A prospective Theory Blogger wants your input (Guest Post)
(Guest Post by M.T. Hajiaghayi) Title: Successful blogs Now that I'm joining Univ. of Maryland, and there are at several famous bloggers there, I may consider...
From Computational Complexity
Repost on Turing and Wasserman- lets talk about...
One of the commenters on the post on the recent Turing Award and the Waterman award pointed out that the context I gave lead to a discussion that was NOT aboutCan...
From Computational Complexity
Central Website for FOCS as a whole (guest post)
(Guest Post by Paul Beame) There is now a central website for the FOCS conference as a whole here!! In addition to links to the most recent and upcoming...
From Computational Complexity
Theorems that you simply don't believe
There are some theorems that are surprising. I've already blogged on that (I can't seem to find the link). However, there are some theorems that some people simply...
From Computational Complexity
Turing Award and Waterman Award and the variety of our field
As Lance tweeted: The Turing Award for 2009 was given recently to Chuck Thacker LINK. See here. He developed the first modern PC. The Alan T. Waterman award...
From Computational Complexity
HW policies: PROS and CONS
The last blog entry had lots of good comments about different HW policies. I enumerate them and say PROS and CONS Hard Deadline. PRO- uniform, no favoritism,...
From Computational Complexity
A HW policy- MORAL due date.
This semester I am using the following HW policy. HW is due on Tuesday. However, your dog died! Hence you get an extension to Thursday. That is, for all people...
From Computational Complexity
Special Issue of TOC in honor of Rajeev Motwani
(Guest post by Samir Khuller, Sudipto Guha, Laci Babai) Special Issue of the journal Theory of Computing in honor of Rajeev Motwani (1962 - 2009) Submit...
From Computational Complexity
Can The Hill Cipher ever be used?
Alice and Bob want to sent a message so that even if Eve intercepts it, she cannot tell what it is. We will allow Alice and Bob a short private meeting to exchange...
From Computational Complexity
Knuth Prize for 2009: David Johnson
Dave Johnson Won the KNUTH PRIZE for 2009: click here I can't add much to the article linked to except to say that it is well deserved. The Wikipedia entry...
From Computational Complexity
CCC 2010 papers posted (I know- Old News)
As Lance tweeted, the papers for CCC 2010 are posted here. The Guest Speakers look AWESOME!: Knot, Raz, Regev. Also Banquet speaker Hartmanis AWESOME! Based...
From Computational Complexity
Is Math too hard?
Are humans good at Math? In the movie Oh God Book II God (played by George Burns) says that Math was a mistake, I made it too hard!. While I am reluctant to...
From Computational Complexity
Doing it OLD SCHOOL!
If you browse the Univ of MD Schedule Web pages for the last few years I would: Ask you why you were doing that. Seems like an odd use of your time. Point out...
From Computational Complexity
What is in MY automata theory course/What should be
In the last post I pondered what was more important: Automata Theory or Crypto. This raises the question of what should be in a course in automata theory. Rather...
From Computational Complexity