Sign In

Communications of the ACM

Blogroll


Refine your search:
dateMore Than a Year Ago
authorLance Fortnow

From Computational Complexity

Do We Still Need Great Minds?

An anonymous comment on a recent post on alternate histories. As far as science is concerned I don't believe that the great minds are needed anymore. They only...

From Computational Complexity

Get Ready

My daughters, now in college, never knew a time when they couldn't communicate with anyone instantaneously. Molly, now 18, takes pride having the same birth year...

From Computational Complexity

Alternate Histories

Imagine if we had a machine that let us change some earlier moment in history and see what developed. We wouldn't actually change history--that would lead to paradoxes...

From Computational Complexity

2016 Fall Jobs Post

The weather cools down, the leaves change color and you start thinking about what you plan to do after you graduate. As a public service every year about this time...

From Computational Complexity

Typecasting from Avi's 60th Celebration

Lance: Live from the Institute for Advanced Study in Princeton, New Jersey, Bill and I are doing a typecast from the Avi Wigderson 60th Birthday Celebration. Hi...

From Computational Complexity

Who's Afraid

The playwright  Edward Albee passed away earlier this month at the age of 88. I had never actually seen any of his plays so I took the opportunity to watch theWho's...

From Computational Complexity

Boris Trakhtenbrot (1921-2016)

I woke up this morning to two pieces of news. Subhash Khot has just been named a MacArthur Fellow, the "genius" award, for his work on unique games. But I also ...

From Computational Complexity

Academic Rankings Foster Competition

This week US News and World Report released their undergraduate rankings earlier this week. A time for schools to brag. US News and World Report used to publish...

From Computational Complexity

Noam Nisan wins the Knuth Prize

Noam Nisan will receive the 2016 Donald E. Knuth Prize, the highest honor in theoretical computer science, for his work in computational complexity and algorithmic...

From Computational Complexity

Why I Don't Believe in ET

Is there life on other planets? The naive answer is "of course, why should Earth be special." What makes a lottery winner special? We could have just won the life...

From Computational Complexity

The Letter

Guest post by Molly Fortnow, incoming member of the University of Chicago class of 2020. On January 24, 2011, a miraculous thing happened. I was published on the...

From Computational Complexity

1956 Was a Fine Vintage

Bill sends me an email last week with the subject "Our field is getting old!" and talks about upcoming 60th birthday/retirement conferences he's invited to, all...

From Computational Complexity

Predicting in Changing Environments

The New York Times yesterday ran a story connecting climate change to the Louisiana flooding. The National Weather Service reports that parts of Louisiana have...

From Computational Complexity

Robin Hanson's Ems

Robin Hanson an economist at George Mason and author of the Overcoming Bias blog, has a new book The Age of Em: Work, Love and Life when Robots Rule the Earth.White...

From Computational Complexity

Seymour Papert (1928-2016)

Seymour Papert, the great AI pioneer, passed away Sunday at the age of 88. In the theory community we best know him for his 1969 book Perceptrons with Marvindied...

From Computational Complexity

GAMES/EC 2016

This week I report from Maastricht in the Netherlands from the GAMES 2016, the 5th World Congress of the Game Theory Society. By having their congress every four...

From Computational Complexity

Snowbird 2016

Earlier this week I attended the 2016 CRA Snowbird Conference, a biennial meeting of CS chairs and other leaders in the the computing community. I’ve attended every...

From Computational Complexity

Excalibur

Goro Hasegawa passed away last week at the age of 83. Hasegawa created and popularized the board game Othello based on an old British game Reversi. Back in the...

From Computational Complexity

STOC 2016

I attended the 2016 STOC Conference earlier this week in Cambridge, Massachusetts. No shortage of awesome results highlighted by László Babai's new quasipolynomial...

From Computational Complexity

The Relevance of TCS

Avi Wigderson responds to yesterday's post. 20 years is a long time, and TCS is in a completely different place today than it was then. I am happy to say that...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account