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
"Never give AI the Nuclear Codes" Really? Have you seen Dr. Strangelove?
(I covered a simlar topic here.) In the June 2023 issue of The Atlantic is an article titled: Never Give AI Intelligence the...
From Computational Complexity
Finding and answer to a math question: 1983 vs 2023.
In 1983, as a grad student, I knew that HALT \( \le_T \) KOLG but didn't know how to prove it. I asked around and A MONTH later through a series of connectionshere...
From Computational Complexity
A futher comment on Chernoff--- and the future of ....
Ravi Boppana recently did a guest blog on Chernoff turning 100 for us here. Consider this unpublished comment on that post: -----------------------------------...
From Computational Complexity
Can you put n pennies on an n x n chessboard so that all of the distances are distinct/how to look that up?
In Jan 2023 I went to the Joint Math Meeting of the AMS and the MAA and took notes on things to look up later. In one of the talks they discussed a problem and...
From Computational Complexity
Ted Kaczynski was at one time the worlds most famous living mathematician
(This post is inspired by the death of Ted Kaczynski who died on June 10, 2023.) From 1978 until 1995 23 mailbombs were send to various people. 3 caused deaths,...
From Computational Complexity
Posting a book online with a password- that you broadcast.
Recently Lance, at the request of Vijay Vazirani, tweeted the following (I paraphrase)------------------------------------------------------------------------...
From Computational Complexity
Quantifiers: To Parenthesize or not to Parenthesize? Matrix of Formula: To Bracket or not to Bracket?
For the book Computational Intractability: A Guide to Algorithmic Lower Boundsby Demaine-Gasarch-Hajiaghayi (See here for a link to a first draft.) we had to...
From Computational Complexity
On Nov 10, 2014 the TV show Scorpion mentions Software that is like ChatGPT for Music
Scorpion is a TV show that ran from 2014 to 2018. It involves a group of brilliant (to say the least) but socially awkward (to say the least) people who help the...
From Computational Complexity
Logic and lack of Logic of Anti Vaxers
I wrote the post below the dotted line a long time ago but never got around to posting it. Now that WHO says COVID emergency...
From Computational Complexity
Take a number and map it to the number of letters in its name
Let f: N--> N map a number to the number-of-letters in its name in English (we will consider other languages later).So for example 14 is fourteen so it maps tohere...
From Computational Complexity
Other Ramsey's
I often Google Ramsey stuff to find something. I often end up back on my own collection of Ramsey theory papers. But I sometimes find OTHER uses of the phrase...
From Computational Complexity
There are an infinite number of proofs that there are an infinite number of primes
In the last few years there have been four papers that prove the primes are infinite using some number theory and some Ramsey Theory. The papers are:Van der Waerden...
From Computational Complexity
Thoughts on Gordon Moore
Gordon Moore passed away on March 24, 2023. He was 94 years old. He is best known for the article Cramming more components onto integrated circuits. It appeared...
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