acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

Advice on getting connecting to the community (guest post by Daniel Apon)

(Guest Post by Daniel Apon.) As a follow up to the last post on Do Conferences Build Community? I offer some advice for people to get connected to the community...

From Computational Complexity

Do conference build community? (joint post)

(Joint Post by Daniel Apon and Bill Gasarch. Does doing joint posts build community?) In GASARCH's post on Will there be a 50th CCC He mentioned that conferences...

From Computational Complexity

New York Area Theory Day- Nov 12, 2010

New York Area Theory Day, Organized by: IBM/NYU/Columbia, External sponsorship by: Google, Friday, November 12, 2010 The Theory Day will be held at Couranthere...

From Computational Complexity

Will there be a 50th CCC? Will you be there?

At the 25th CCC Juris Hartmanis gave a great talk to celebrate having a 25th. Will there be a 50th? I asked people at the conference. What did they say? Watch the...

From Computational Complexity

How hard is this problem?- I ask this non-rhetorically

I recently saw the following puzzle: Which two numbers come at the end of this sequence? (That is, what are x and y?) 2,4,5,30,32,34,36,40,42,44,46,50,52,54...

From Computational Complexity

Two Candidates for an Ig Noble in Mathematics

(This is a sequel to my post on the Ig Nobel Prize.) Two candidates for an Ig Nobel prizes in Mathematics. They deserve it for opposite reasons. (They are old...

From Computational Complexity

Noble and Ig Noble Prizes

What is the Ig Nobel prize? To quote the website: The Ig Nobel Prizes honor achievements that first make people laugh, and then make them think. The prizes are...

From Computational Complexity

Review of Lipton's Book-Blog/Review of Goldreich and Arora-Barak/New Book Review Column/Do you want to review?

My review of Lipton's new blog-book is here. It will appear in my SIGACT NEWS at some later time. Daniel Apon's joint review of Computational Complexity: A...

From Computational Complexity

Theorems that are less interesting because they are more interesting

(This post was inspired by Joe Kruskal's passing. Kruskal's tree theorem, trees under minor are a well quasi order, relates to example 2 below.) There are some...

From Computational Complexity

Joseph B Kruskal passed away (Guest post by Clyde P Kruskal)

(Guest post from Clyde P Kruskal.) Yesterday (September 19, 2010) my uncle, Joseph B. Kruskal passed away. I just wanted to say a few personal words. Maybe,...

From Computational Complexity

Should You Mentor High School Students?

I have mentored many high school students on projects (21 in the past, 6 right now). Is this a good use of ones time? I note my experiences and advice- if you have...

From Computational Complexity

A Mathematical Urban Legend

I have heard the following story many times in many versions: A PhD student in Math at PRESTIGIOUS SCHOOL was defending his thesis which was in REALLY ABSTRACT...

From Computational Complexity

The Rubik's Cube Conjecture PROVEN! (Do we care?)

In 1994 Fermat's last theorem was proven! In 2003 Poincare's conjecture was proven! In 2010 the Rubik Cube Conjecture was proven! That is, it was shown that the...

From Computational Complexity

Intelligent questions about the alleged P NE NP proof

People have asked me how much the alleged proof of P NE NP was discussed at Barriers II. Actually, nobody discussed the proof; however, we did discuss the aftermath...

From Computational Complexity

Report from Barriers II Part 1

On Thursday Aug 26 Lance stated Bill is at Barriers II in Princeton and promises a full report upon his return. Not quite sure I promised that, or what a full report...

From Computational Complexity

***SORELLE*** PHD!!/Workshop on Boolean Threshold Functions/NSF program

Three annoucements (the last two I was asked to post) ANNOUCEMENT 1: Congrads to fellow blogger ***SORELLE*** who got her PhD recently. I was on her committee...

From Computational Complexity

NEW math on Futurama

The Aug 19, 2010 episode of Futurama had NEW math in it! It also has some other math refs. This website claims that Ken Keeler, one of the writers who has a...

From Computational Complexity

Is Scheduling a Solved Problem? (Guest Post)

(Guest Post by Ben Fulton.) "At first glance, scheduling does not seem like a topic that requires much attention from computer scientists". This was how I...

From Computational Complexity

Today is Paul Turan's 100th Birthday!

The following conversation is a fictional version of a real conversation. Lance: Bill, Wed August 18, 2010 is Paul Turan's 100th birthday. We should post onGASARCH...

From Computational Complexity

My last post on the alleged P NE NP paper

(This is likely my last post on the alleged P NE NP paper unless more real news on it occurs. The only real news I can see happening at this point is a retraction...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account