acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

Imagining Imaginary Probabilities

In the year 4000BC my great-great-...-great grandmother tried to solve (in today's terms) the equation x2 + 2x + 2 = 0 She discovered that if it had a solution...

From Computational Complexity

Some quantum Stuff

Two quantum announcements (emailed to me by Umesh Vazirani, and produced here almost exactly) and then some thoughts of mine quantum computing. Announcement one...

From Computational Complexity

Theory Day at UMCP Oct 24

The University of Maryland at College park is having a Theory Day on Wed Oct 24! Come hear Distinguished talks by Julia Chuzhoy and Venkataesan Guruswami! Short...

From Computational Complexity

Should we learn from the Masters or from the Pupils?

The following is a paraphrase of a comment at the end of the Suggested Readings section of Spivak's calculus book: Abel remarked that he attributed his profound...

From Computational Complexity

Neil Armstrong, Ray Bradbury: The future is not what we thought it would be

Neil Armstrong died on August 25, 2012.  He was the first man to walk on the moon.  (Since they always say this I wonder if Women walked on the moon earlierRay ...

From Computational Complexity

Fellow blogger Abie Flaxma named Top Innovator!

(Guest post from William Heisel, Assistant Director for External Relations, Institute for Health Metrics and Evaluation, University of Washington, 2301 5th Avenue...

From Computational Complexity

Book Review Column (a bit late)

I try to post my book review column when it comes out but I am behind on that. This is the one that came out a few months ago.  The column is here though I have...

From Computational Complexity

My take on the Olympics

Thoughts about the Olympics If you are rooting for your country, would you rather they get (say) 18 medals: 6 Gold, 6 Silver, 6 Bronze, or 17 medals: 10 Gold...

From Computational Complexity

A natural function with very odd properties

Last time I posted some questions. Today I post the answer that I know. Is there a subset of [0,1] that is uncountable and has measure 0?  YES- take theCantor...

From Computational Complexity

Six Questions about unnatrual and natural mathematical objects

Today (Monday) I pose some questions. In my next post (Tuesday) I will post the answersthat I know (some I do not). Some questions are a matter of opinionin terms...

From Computational Complexity

The Combinatorics of Batman

(I wrote this post about a year ago but waited until the new Batmanmovie came out to post it. I haven't seen the movie yet sothere may more possibilities to add...

From Computational Complexity

CCC12- post 4 of 4- Misc Info.

CCC 12 post 4 of 4. The business meeting and other observations. Programming committee info: There were 119 submissions of which 18 were junk (more on that...

From Computational Complexity

CCC 2012- Post 3 of probably 4

Post 3 of n on CCC 2012. I still don't know what n is. I summarize the third and fourth day of the conference. (The fourth day was only a half-day). Thursday June...

From Computational Complexity

CCC 2012: Post 2 of n

CC 2012. I still don't know what n is. I summarize the second day of the conference. Wednesday June 27 Morning Session: A Satisfiable Algorithm and Average Case...

From Computational Complexity

CCC12: Post 1 of n

(Post 1 of n on CCC 2012. I don't know how large n is yet.) I will discuss the papers in the order they were presented. June 26, 2012. Morning Amplifying Circuit...

From Computational Complexity

North Carolina tries to legislate science

(I will post on CCC 2012 next week. I am still recovering from Jet Lag and going through 472 emails that piled up on 2.5 weeks, of which 22 were relevent.) You...

From Computational Complexity

The Ketchup Problem

MIT scientists are working on a bottle of ketchup where you CAN get out every last drop.  See here for details and some nice videos of the new bottle in action....

From Computational Complexity

Do 50-1 longshots in the Kentucky Derby ever come in?

(I delayed posting this until after The Belmont Stakes since I wanted to see if there would be a Triple Crown winner.Alas, I'll have another was scratched. From...

From Computational Complexity

A new bound on 3-hypergraph Ramsey Number! Why wasn't it discovered earlier?

When a new result is first discovered one question to ask is Why wasn't it discovered earlier? We look at a result in Ramsey Theory from 2010 and speculate asHypergraph...

From Computational Complexity

17x17: Paper that solved it available!/A contest inspired by it!/NPC result inspired by it!

Three new 17×17 items: The paper (and some sequels) that SOLVED the 17×17 problem and the 17×18 problem are now available here. (I can't seem to link to the page...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account