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
Do we use Technology before its perfected? Should we?
During Hurricane Irene I lost power for about 18 hours. I was actually pleased how short this was. PEPCO (my power company) did not tell us when power would beprior...
From Computational Complexity
What inspired you to work on... whatever you work on?
Grad students often wonder how people get ideas of things to work on. The usual advice I give is (1) go to talks, (2) read papers, (3) talk to people, (4) follow...
From Computational Complexity
An application of Ramsey Theory to Proving Programs Terminate
B. Cook, Podelski, and Rybalchenko have done both practical and theoretical work on proving that programs terminate. They use Ramsey's Theorem (Yeah!). Jon Katz...
From Computational Complexity
What is a simple function?
In my discrete Math course I asked the following question: For each of the following sequences find a simple function a(n) such that the sequence is a(1), a(2)...
From Computational Complexity
If I was a tweeter (is that a word?)
Since Lance is not tweeting this week, I will take up the slack. So, here is my once-in-a-while post If I tweeted AND if tweets didn't have to be so short, here...
From Computational Complexity
Does STOC/FOCS take simple-nice-ideas papers? A one-element case study
WRITTEN AUG 1,2011: It has been said that simple innovative ideas to not get into STOC/FOCS and only hard technical improvements do. This is one of the motivations...
From Computational Complexity
Why did 1+1=2 take Russell and Whitehead 300 pages?
In my post about the myth that Logicians are crazy I mentioned in passing that Whitehead and Russell spend 300 pages proving 1+1=2 (but were both sane). Two people...
From Computational Complexity
Looking for people to review books for my column
I am looking for reviewers for the following books for my SIGACT NEWS book review column. I will try to edit this post to keep the list up to date; however, ifthis...
From Computational Complexity
Disproofing the Myth that many early logicians were a few axioms short of a complete set
While I was working on this post another blogger posted on the same topic here and I found a book review of Logicomix that touched on some of the same issues here...
From Computational Complexity
Math, the Universe, and Everythign: Max Tegmark's Interpretation of reality (guest post)
(This is a guest post by Nadia Jones who blogs at online college about education, college, student, teacher, money saving, movie related topics. You can reach her...
From Computational Complexity
A slightly diff take on Liptons use or Ramsey's Theorem
This post takes an idea of Dick Lipton's in a slightly different direction. ω(G) is the size of max clique in G. Recall that, for all 0 < δ1 < δ2 < 1, the...
From Computational Complexity
Scooped by 400 years
This article claims that finding the area under a curve by dividing up the region into rectangles is helpful. Maybe they could take some sort of... limiting process...
From Computational Complexity
Math on FUTURAMA and LAW AND ORDER:CI
MATH ON TV FUTURAMA mentions the Banach-Tarski Paradox! In the June 23, 2011 episode Professor Farnsworth invents a Banach-Tarski-Dupla-Shrinker which takeshere...
From Computational Complexity
FCRC 2011. Part 2 of... probably 2.
(A workshop on Coding, Complexity and Sparsity will be held at Ann Arbor, August 1-4, 2011. See this website.) More thoughts on FCRC. Russell Impagliazzo...
From Computational Complexity
I am conducing a NEW POLL on P vs NP
In 2002 I did a poll that appeared as SIGACT News Complexity Theory Column 36 on what people thought of P vs NP. See here. That article is now linked to on...
From Computational Complexity
FCRC 2011. Part I of... maybe I, maybe more.
I do not log on at conferences so I came back to 400 emails. Exactly 400- not sure how I managed that. TODAY I am posting about a few things from FCRC, I may post...
From Computational Complexity
RaTLoCC (Ramsey Theory in...)
I was at RatLoCC last week which stands for Ramsey Theory in Logic, Combinatorics and Complexity. The idea was to bring in researchers for all three areas (actually...
From Computational Complexity
On demand Publishing (guest post)
Cambridge Press (and others) offers PRINT-ON-DEMAND for some books. This is a guest post by Lauren Cowles from Cambridge Books about this, and then my commentsWhats...
From Computational Complexity
President Regan (not Reagan)
Whose name (in firstname lastname form) appeared most often in the pages of Newsweek in the 1970's? Is it---? Richard Nixon Gerald Ford Jimmy Carter Ken Regan...
From Computational Complexity