ACM

Communications of the ACM

Blogroll

Refine your search:

Artificial Intelligence Makes Harsher Judgments than Humans on Whether rules have been Broken, a new study claims.

From The Eponymous Pickle Artificial Intelligence makes Harsher Judgments than Humans on Whether Rules have been Broken, a new study claims By PolArtificial… Franz Dill | May 23, 2023

From Computational Complexity

You are coordially invited... Why?

When you get an invitation via email should you accept? How well targeted is it? Some real examples that I got. EXAMPLE ONE: I would like to invite you toclick... GASARCH
From Computational Complexity | October 6, 2009 at 05:15 PM

From Computational Complexity

Two Recent Complexity Books omit Mahaney's theorem- ovesight or wisdom?

In a prior post (a while back) I pondered if Mahaney's theorem (SAT \le_m S, S Spare, implies P=NP) should be taught in a basic grad course in complexity. I thought... GASARCH
From Computational Complexity | October 5, 2009 at 05:16 PM

From Computational Complexity

The Journal Manifesto 2.0

Reminder: FOCS early registration deadline today. Go here Below is a revised version of the Journal Manifesto. I restate the key sentence from my last post and... GASARCH
From Computational Complexity | October 1, 2009 at 05:16 PM

From Computational Complexity

The Journal Manifesto

Some people say that for-profit journals do not currently serve our community well. Some even think they cannot do so. Others think they are doing a fine job as... GASARCH
From Computational Complexity | September 30, 2009 at 05:17 PM

From Computational Complexity

Debunking Proofs

One of the comments of the last post asked my (or someones) opinion on the proofs floating around that P=NP or P\ne NP. As a grad student I used to readWhat... GASARCH
From Computational Complexity | September 28, 2009 at 05:18 PM

From Computational Complexity

My two cents on P vs NP

There have been several posts on blogs about P vs NP and two expository articles. Is there anything else to add. I'm not sure, but here are my 2 cents. QUESTION... GASARCH
From Computational Complexity | September 24, 2009 at 05:19 PM

From Computational Complexity

Another Reason to goto FOCS: Theory Day!

(Posted by request of Vijay V. Vazirani. Flame him for any spelling or grammar mistakes, or if you don't like the content.) Another reason to goto FOCS:here... GASARCH
From Computational Complexity | September 23, 2009 at 05:20 PM

From Computational Complexity

Possibly Recruits for the Polymath Primes Project

In the book The Man who Mistook his Wife for a Hat and other Clinical Tales by Oliver Sacks there is a true story about two twin brothers (John and Michael), both... GASARCH
From Computational Complexity | September 17, 2009 at 05:21 PM

From Computational Complexity

Announcing a New Blog: Silent Glen Speaks

There is another Theory Blogger: Silent Glen. How can a blogger by silent? Sounds like a contradiction in terms! Hope its not a contradiction since she is already... GASARCH
From Computational Complexity | September 16, 2009 at 05:22 PM

From Computational Complexity

Ambiguity

I recently heard or read the following phrases. former cop killer ideal compromiser even prime numbers have their uses In each case it was ambiguous... GASARCH
From Computational Complexity | September 14, 2009 at 05:22 PM