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 CS4FN (Computer Science For Fun)
Cold hard complexity: learning to talk in nature’s language
Think of an ecosystem like a sentence – there are thousands of words in the English language but in order to make a sentence you have to put them together in the...
From CS4FN (Computer Science For Fun)
Love your data
Some councils put up 'Ignore your sat nav' signs because drivers kept relying more on the wrong information from electronic directions instead of trusting their...
From CS4FN (Computer Science For Fun)
Delicious computing: gestural computing with bananas and pizzas…
Imagine being able to pick up an ordinary banana and use it as a phone. That's part of the vision of 'invoked computing', which is being developed by Japanese researchers...
From CS4FN (Computer Science For Fun)
Hiding in Skype: cryptography and steganography
Computer Science isn't just about using language, sometimes it's about losing it. Sometimes people want to send messages so no one even knows they exist and a great...
From Computational Complexity
Thanks for the Fuzzy Memories
In the 1990's Manindra Agrawal and V. Arvind published a paper claiming that if SAT is reducible to a (non-uniform) weighted threshold function then P = NP. Their...
From Return 42;
Testing for Superclass With Shoulda
While I was refactoring a hand full of commonly used methods from a few controllers into a superclass, I was looking for a way to test that these controllers are...
From Computational Complexity
The Molly Solution
This week Bill and I are both at the Dagstuhl Workshop on Algebraic Methods in Computation Complexity. I'll try to cover some of the talks and discussions on the...
From The Eponymous Pickle
Examples of Visualization
A number of interesting visualizations of data. The original piece is 50 great examples of data visualization. There is no doubt that these are colorful, finely...
From Computational Complexity
Complexity Vidcast 2
Bill and I battle it out over what should be taught in a complexity course in our new vidcast.
From Computational Complexity
Publicity for P versus NP
On the New York Times website, John Markoff writes an article Prizes Aside, the P-NP Puzzler has Consequences motivated by my CACM article on The Status of the....
From The Eponymous Pickle
See Search Results as PDF
In what seems like a small thing, Google now lets you get a quick view of search results, Gmail and Google docs as a PDF. As a result you can preserve more formatting...
From Computational Complexity
You are coordially invited... Why?
When you get an invitation via email should you accept? How well targeted is it? Some real examples that I got. EXAMPLE ONE: I would like to invite you toclick...
From Computational Complexity
Two Recent Complexity Books omit Mahaney's theorem- ovesight or wisdom?
In a prior post (a while back) I pondered if Mahaney's theorem (SAT \le_m S, S Spare, implies P=NP) should be taught in a basic grad course in complexity. I thought...
From Computational Complexity
On Being Narrow
In a tweet a few days ago, David Bacon wonders why everyone always assumes all he can do is quantum computing? Oh, because that's all he's done. Time to do something...
From Computational Complexity
The Journal Manifesto 2.0
Reminder: FOCS early registration deadline today. Go here Below is a revised version of the Journal Manifesto. I restate the key sentence from my last post and...
From Computational Complexity
The Journal Manifesto
Some people say that for-profit journals do not currently serve our community well. Some even think they cannot do so. Others think they are doing a fine job as...
From Computational Complexity
The IT Rules
My family has discovered a British Series, the IT Crowd, about two techies in a corporate IT department. An American version never got past the pilot phase. ...
From Computational Complexity
Debunking Proofs
One of the comments of the last post asked my (or someones) opinion on the proofs floating around that P=NP or P\ne NP. As a grad student I used to readWhat...
From Computational Complexity
Inspiring a Love of Math
A reader writes I come to you by way of your computational complexity blog. I get that there is some really good stuff there, but frankly don’t understand about...
From Computational Complexity