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
Guest Post on ICS 2010 (2 of 3)
Innovations in Computer Science 2010 (post #2) Guest Post by Aaron Sterling This is the sequel to my previous post on ICS 2010, the new theoretical computer...
From Computational Complexity
Guest Post on ICS 2010 (1 of 3)
Innovations in Computer Science 2010 (post #1) Guest post by Aaron Sterling This is the first of three posts about ICS 2010, the much-discussed "concept...
From Computational Complexity
COLT and CCC
The COLT (Computational Learning Theory) call for papers is out. (Actually its been out since October but I was only recently emailed it.) For other information...
From Computational Complexity
DO NOT do this when choosing books for your class
When I took my first graduate course in complexity theory the professor had FOUR books on the REQUIRED FOR THE COURSE list. I bought all four. He said that We...
From Computational Complexity
Axioms: What should we believe?
Some misc thoughts on set theory inspired by yesterdays comments and other things. Geometry: Use Euclidean Geometry when appropriate, for example if you are So...
From Computational Complexity
Voting on Mathematical Truths: The Axiom of Det.
One of the founders of Conservapedia (a conservative alternative to Wikipedia) said the following on The Colbert Report: There is an absolute truth. People don't...
From Computational Complexity
How to tell how good a TV show is
(This is my last blog of the year. Lance will interupt his blog sabbatical to do an END OF THE YEAR blog later.) The TV show MONK recently finished its 8thHow...
From Computational Complexity
What is an Explicit Construction?
The Prob method (usually credited to Erdos) was once considered quite novel: You show something exists but you don't show how to construct it! An early exampleThe...
From Computational Complexity
A hard problem inspired by an easy problem
The following problem was problem 1 (the easy one) on the Maryland Math Competition 2009 (I will later report on how the students did on it). Show that for every...
From Computational Complexity
Guest Post- Women in Theory Workshop
(Tal Rabin requested to post this so I am doing so. This post is essentially her email, so call it a guest post.) There will be a Women In Theory workshop for...
From Computational Complexity
Mild Request for Guest Posters.
(Deadline to submit a paper to CCC is Dec 15. Depending on when you read this that could be today or in the past.) As you all know from Lance's last post, Lance...
From Computational Complexity
CCC deadline Dec 15, 2009! (not factorial)
Submissions to 25th CCC are due TOMORROW! (Actually it could be TOMORROW, TODAY, or IN THE PAST depending on when you read this.) Should you submit? If you have...
From Computational Complexity
Whats your Game Mr. Bond? Nim?
BILL: Clyde is teaching a graduate course titled Games, Game Theory, and the Theory of Games. He tells me that there are basically eight kinds of games governed...
From Computational Complexity
Is posting about 17x17 problem BAD FOR ACADEMIA?
(The 17x17 problem has gotten far wider attention than I imagined--- Brian Hayes posted it on his website: here, and its also here and here. The last website is...
From Computational Complexity
Congrads to new ACM fellows
Congrads to ALL of the ACM Fellows which were annouced here. There are several theorists among them. I could try to list them or count them; however, the term...
From Computational Complexity
17x17: Comments on your comments
One of the comments on my last post, the 17x17 post, inquired if I am also interested in the other unknown grids (17x18, 18x18, 21x10, 21x11, 21x12, 22x10). I AM...
From Computational Complexity
The 17x17 challenge. Worth $289.00. This is not a joke.
The 17x17 challenge: worth $289.00. I am not kidding. Definition: The n x m grid is c-colorable if there is a way to c-color the vertices of the n x m grid soThe...
From Computational Complexity
An Undervalued Math Problem
As most of you know there are 7 problems worth $1,000,000 (see here). It may be just 6 since Poincare's conjecture has probably been solved. Why are these problems...
From Computational Complexity
Laptops in Church?
There are now bibles online where you can click for different versions, different translations, different interepretations, historical context, etc. The same is...
From Computational Complexity