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
The SIGACT Book Review column list of books it wants reviewed
I am posting this for Nick Tran who is the current SIGACT Book Review Editor (before him it was Fred Green for about 6 years, and before him it was me (Bill Gasarch)...
From Computational Complexity
New Upper Bound on R(k). WOW!
R(k) is the least n such that for all 2-colorings of the edges of \(K_n\) there is a monochromatic \(K_k\)(so there are k vertices such that the coloring restricted...
From Computational Complexity
Problems we assume are hard. Are they?
We think SAT is hard because (1) its NPC, and (2) many years of effort have failed to get it into P. Imagine a world where we didn't have the Cook-Levin Theorem...
From Computational Complexity
I wish we had less students in a Class. Demographics says I may get my wish.
According to this article, in the near future LESS people will be going to college. There is even a name for this upcoming shift: The Enrollment Cliff. Why?Ishere...
From Computational Complexity
It is more important than ever to teach your students probability (even non-stem students)
You are a college president. An online betting company says We will give you X dollars if you allow us to promote online gambling at your University.I suspecthere...
From Computational Complexity
When is a paper `Easily Available' ?
I was looking at the paper PSPACE-Completeness of reversible deterministic systemsby Erik Demaine, Robert Hearn, Dylan Hendrickson...
From Computational Complexity
After you are notified that an article is accepted...
After just one round of referees reports(they send me the reports, I made the corrections, they were happy) I got email saying my paper on proving the primes are...
From Computational Complexity
Why does pi come up so often? I don't know either but ...
Here is how history DID unfold:1) People noticed that the ratio of the circumference to the diameter of ANY circle is always the same, it's a number between 3this...
From Computational Complexity
The Betty White Award for 2022
In Dec 2021 I noted in this post, which was my 1000th post ever (according to Ken Regan, see here) that Betty White had the misfortune of dying on Dec 31, 2021,...
From Computational Complexity
ChatGPT tried to write an obit for Martin Davis. What it got right, wrong, and what to make of it.
When Martin Davis passed away Lance emailed me what he got from using ChatGPT to do an obit. Here it is and I also note what it got wrong.----------------------...
From Computational Complexity
Martin Davis Passed Away on Jan 1, 2023
As you probably already know from other sources, Martin Davis passed away on Jan 1, 2023, at the age of 94. His wife Virginia died a few hours later.He majoredOccasionally...
From Computational Complexity
Voter Suppression, Harvard Style
The following appeared on Harry Lewis's blog, here, hence it is written in his voice, though it is a co-authored. You'll see why later. I then have some comments...
From Computational Complexity
Commercials are not logical. FTX edition.
Some people asked me to comment on FTX since I teach Crypto. My insights are no better than anyone else; however, I have wanted to do a blog post about the illogic...
From Computational Complexity
Harry Lewis's talk on The Birth of Binary on Dec 8 (Thats today!)
More on the information on Harry Lewis's talk is in his blog post about it:here1) On Dec 8, 2022 Harry Lewis is giving the annual Thoraf Skolem Memorial Lecture...
From Computational Complexity
Would you be more productive if you didn't log on? It worked for Christopher Havens!
There are times when NOT having computer access (is that possible anymore?) can make you MORE productive. 1) I did a lot of my Muffin Work when I was in MexicoTexas...
From Computational Complexity
Who first thought of the notion of Polynomial Time?
(Updated version of Computational Intractability: A Guide to Algorithmic Lower Bound by Demaine-Gasarch-Hajiaghayi is here)Any question like who first though of...
From Computational Complexity
Euclidean TSP is NP-hard but not known to be in NP. Why not known?
BILL: Lance, I was looking into TSP, metric TSP, Euclidean TSP since I am going to teach about P, NP, NPC, and approximating NPC problems and I came across theThe...
From Computational Complexity
Does the Physics Nobel Prize Winner understand their own work (guest post)
David Marcus was a Math major a year ahead of my at SUNY Stonybrook (he graduated in 1979,I graduated in 1980). He then got a PhD from MIT in Math, and is a reader...
From Computational Complexity
The Media Coverage of the Matrix result is Terrible (though not worse than usual)
BILL: A computer program (or an AI or an ML or whatever) found a BETTER way to do matrix mult! Its in the same spirit as Strassen. I've always wondered if Strassen...
From Computational Complexity