acm-header
Sign In

Communications of the ACM

Blogroll


Refine your search:
datePast Year
authorgasarch
bg-corner

From Computational Complexity

ChatGPT thinks Graph Isomorphism has real applications. Is it right?

Lance did a post on Babai's result on Graph Isomorphism (see here). I then did a post asking if Graph Isomorphism has real applications (see here).  Lance proofread...

From Computational Complexity

Are there any REAL applications of Graph Isomorphism?

Lance's post on Babai's result on Graph Isomorphism (henceforth GI) inspired some random thoughts on GI. (Lance's post is here.) 1) Here is a conversation withOrganic...

From Computational Complexity

The advantage of working on obscure things

 I got an email from an organization that wants to publicize one of my papers. Which paper did they want to publicize? 1) If the organization was Quanta, they...

From Computational Complexity

Certifying a Number is in a set A using Polynomials

 (This post was done with the help of Max Burkes and Larry Washington.)During this post \(N= \{0,1,2,\ldots \}\) and  \(N^+=\{1,2,3,\ldots \}\).Recall: Hilbert's...

From Computational Complexity

A paper that every Undergraduate should read

 The paper As we may thinkbyVannevar Bush appeared in The Atlantic Monthly, in July 1945. I first read it since it was one of the papers in Ideas that Created the...

From Computational Complexity

A nice dice problem-Part 2

In my last post (see here) I posed a dice problem, promising to give the answer in the next blog which is this blog. Here is the problem from my last blog:-----...

From Computational Complexity

Guest Post by Mohammad Hajiaghayi on SODA Business Meeting 2024

This is a guest post Mohammad Hajiaghayi on the SODA business Meeting from 2024. The meeting was held in Alexandria Virginia, Jan 7-10, 2024. The following meetings...

From Computational Complexity

A nice dice problem- Part I

In this blog I pose a dice problem. The problem is NOT mine and the answer is KNOWN. However, I DO NOT  think its well known, and I DO think it's interesting. My...

From Computational Complexity

The Betty White Award for 2023: Tommy Smothers

Betty White died on December 31, 2021. When I mention that, even now, some people are surprised that they didn't hear about it. Why? Because she died AFTER allarticles...

From Computational Complexity

Archimedes, Pi, and Pickelball

I typed 3,1,4,1,5,9 into OEIS and,  as expected, I found that these are the first few digits of \(\pi\). See here.I then read on the page:\(\pi\) is sometimes refereed...

From Computational Complexity

Where do Journals go to Die?

In 2011 I had a post, here, about a real journal called The Antarctica Journal of Mathematics. Note that I put in the link in the last sentence; however, if you...

From Computational Complexity

Where do Non-Primitive Recursive Functions come up NATURALLY?

The following is a conversation between Clyde Kruskal and Bill Gasarch.CLYDE:  Bill, a student, Ian Roberts,  asked me if there are any non-primitive recursivehere...

From Computational Complexity

Can I make money in the betting markets based on what i ``know'' about the Republican VP choide

The betting markets for the Republican VP are here.Assume that I am very confident that the VP won't be Nikki Haley. I can buy a NO share for 90 cents (that may...

From Computational Complexity

Forgetting your password is usually not a big deal. Unless....

When I forget my password I can usually reset it and get back to where I was.  Of course, before I get access I am nervous that its not going to work. And there...

From Computational Complexity

In the bad old days we had Punchcards. How did people deal with that?

In the fall of 1976 I started as a Freshman at SUNY Stony Brook intending to major in Math and Computer Science.  I took Honors Calculus I and CS 1. The CS course...

From Computational Complexity

Theory that really DOES apply: Security.

 I recently read and wrote a review of                               Math for Security by Daniel Riley.(For the review see here. It will appear in SIGACT News at...

From Computational Complexity

When did Math Get So Hard- Part 2

Click here for When did Math Get so Hard-Part 1, though it was not called Part 1 at the time. This post is not so much about WHEN math got so hard but an example...

From Computational Complexity

Paper is a tech-free way to preserve writing. Is there a tech-free way to preserve sound (e.g., music)

I blogged about ACM going mostly paper-free, and had some PROS and CONS about paper-free, in this blog here. One of my many astute readers named Abigail pointed...

From Computational Complexity

Young Sheldon gets two things spot-on/Am I more famous than.../Might YS become TS?

 Young Sheldon  is a TV show that I used to only watch on airplanes, but then i got into it and am now up to date. The wonders of technology! Note that catching...

From Computational Complexity

ACM to go paper-free! Good? Bad?

The ACM (Association of Computing Machinery) will soon stop having print versions of most its publications. Rather than list which ones are going paper free, Iare...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account