Sign In

Communications of the ACM

Blogroll



From Computational Complexity

Random Thoughts on the Election (2020)

1) Biden will be the oldest president (measuring by when they take the oath of office), at 78. The next two are Trump 70 and Reagan 69. Biden will be older entering...

From Computational Complexity

I polled my class about the election

 In 2016 I had the Sophomore discrete math class do a poll of who they wanted for president.In 2020 I had the  both my  Senior Crypto class and Clyde's Sophomore...

From Computational Complexity

Do not become obsessed with the Polls unless...

I know someone who checks the polls 3 times a day to see who looks like they will be elected prez. She cares A LOT about the election. It is irrelevant to this...

From Computational Complexity

Nature vs Nurture close to my birthday

 Since I was born on Oct 1, 1960 (that's not true---if I posted  my real birthday I might get my  identity stolen), I will do a nature vs nurture post based onhere...

From Computational Complexity

Hugh Woodin, Kurt Godel, Dwayne `The Rock' Johnson, Robert De Niro, David Frum, Tom Selleck: Do I care what they think? Should I?

 MATH:My last post on CH mentioned that Hugh Woodin used to think NOT(CH) but now thinks CH. In both cases his reasons have some math content to them. Also, note...

From Computational Complexity

Revisiting the Continuum Hypothesis

I have been thinking about CH lately for two reasons1) I reread the articleHilbert's First Problem: The Continuum Hypothesis by Donald Martin from Proceedings of...

From Computational Complexity

A Quote from Testla which is very predictive in one way, and perhaps not in another way

 Nikola Testla, famous inventor, who lived 1856--1943 said the following:When wireless is perfectly applied the whole earth will be converted intoa huge brain,...

From Computational Complexity

Baseball can go on forever, it doesn't just seem that way

 Most games have some way to make sure they cannot go on forever.1) Chess: I had thought there was a 50-move rule and a 3-times-same-position rule, but its a byte...

From Computational Complexity

An interesting serendipitous number

 Last seek I blogged about two math problems of interest to me here.One of them two people posted answers, which was great since I didn't know how to solve them...

From Computational Complexity

When are both x^2+3y and y^2+3y both squares, and a more general question

 In my last post (see here) I asked two math questions. In this post I discuss one of them. (I will discuss the other one later, probably Monday Sept 14.)For which...

From Computational Complexity

Two Math Problems of interest (at least to me)

 I will give two math problems that are of interest to me.These are not new problems, however you will have more fun if you work on them yourself and leave comments...

From Computational Complexity

A well known theorem that has not been written down- so I wrote it down- CLIQ is #P-complete

(The two proofs that CLIQ is #P-complete that I wrote up and talk about in this post are here. I think both are well known but I have not been able to find a writeup...

From Computational Complexity

Sharp P and the issue of `natural problems'

 #P was defined by Valiant as a way to pin down that the PERMANENT of a matrix is hard to compute.The definition I give is equivalent to the one Valiant gave.ghere...

From Computational Complexity

Mathematics is not commutative

In my poll of P vs NP and other issues, one of the questions was                              Is factoring in P? One of the most interesting answers was   I...

From Computational Complexity

Random Thoughts on the Pandemic

 1) Contrast the following two points and, if you have an intelligent way to fill-in-the-blank for the second one, please comment.a) When Trump says `open the schools...

From Computational Complexity

Do Senators have an Advantage for being Dem VP Nominee?

This is a non-partisan post. Even so:  I plan to vote for Joe Biden.(Lance says that whenever I write `this is a non-partisan post'  its partisan anyway.)I've had...

From Computational Complexity

Do computers make us more safe or less safe?

Norbert Weiner wrote a paper Some Moral and Technical Consequences of Automation in 1960. It warns of the dangers of computers in two ways: 1) If a chess program...

From Computational Complexity

Erdos-Turan for k=3 is True!

(All of the math in this post is summarized (without proofs) in a writeup by Erik Metz and myself which you can find here. It is a pdf file so you can click onGil...

From Computational Complexity

Ronald Graham: A summary of blog Posts We had about his work

To Honor Ronald Graham I summarize the blog posts we had about his work. 1) Blog post New Ramsey Result that will be hard to verify but Ronald Graham thinks its...

From Computational Complexity

Reflections on Ronald Graham by Steve Butler

Ronald Graham passed away on July 6 at the age of 84. We present reflections on Ronald Graham by Steve Butler. Getting to work with Ron Graham Ron...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account