acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

Imitators and Innovators Adopt RISC
From Blog@Ubiquity

Imitators and Innovators Adopt RISC

While it may come as a surprise, today RISC architecture computer systems dominate the mobile computing landscape. It has been 40 years in the making. The post ...

What Can Paragons of Literature Teach Us about Writing Better Computer Programs?
From Blog@Ubiquity

What Can Paragons of Literature Teach Us about Writing Better Computer Programs?

While grappling with mechanics of writing, we all too often lose sight of another important insight into effective communication. The post What Can Paragons ofBLOG...

Are Google and Apple About to Pivot?
From Blog@Ubiquity

Are Google and Apple About to Pivot?

The ability to pivot is a sign of agility. As technology continue to rapidly advance, how close are Google and Apple to pivoting? The post Are Google and AppleBLOG...

Will the Flying Car Make a Comeback?
From Blog@Ubiquity

Will the Flying Car Make a Comeback?

We're still waiting for flying cars to materialize as a mass-market product. Why? The answer lies in computer technology—or the lack thereof. The post Will theBLOG...

Can Robots Be Trusted?
From Blog@Ubiquity

Can Robots Be Trusted?

Can robots be trusted to make better decisions than humans? Sometimes automation can be a matter or life or death. The post Can Robots Be Trusted? appeared first...

Why Physical Cyber Security is Broken
From Blog@Ubiquity

Why Physical Cyber Security is Broken

The physical Internet is evolving away from resiliency toward fragility and vulnerability. A broken Internet means flawed cybersecurity. The post Why Physical Cyber...

The Future of Tech is Regulation
From Blog@Ubiquity

The Future of Tech is Regulation

The future of technology is government regulation—NOT unbridled technology. The post The Future of Tech is Regulation appeared first on BLOG@UBIQUITY.

Why Can’t Programmers Be More Like Ants? Or a Lesson in Stigmergy
From Blog@Ubiquity

Why Can’t Programmers Be More Like Ants? Or a Lesson in Stigmergy

If we want to advance the art and science of software development, we should direct our attention to the insect world of stigmergy. The post Why Can’t Programmers...

Why We Don’t Know Know-How
From Blog@Ubiquity

Why We Don’t Know Know-How

In pursuit of scientific understanding, too often we forget our level of know-how is far more important than our know-what. The post Why We Don’t Know Know-HowBLOG...

The Facebook Method of Dealing With Complexity
From Blog@Ubiquity

The Facebook Method of Dealing With Complexity

Computer systems used to be weak, so we had to make their world simple and standardized. They now can handle almost endless complexity—but we still need to understand...

Government Surveillance Will Fragment the Internet
From Blog@Ubiquity

Government Surveillance Will Fragment the Internet

The NSA's track record on government surveillance, which many argue violates fundamental constitutional rights, may lead to a fragmented Internet. The post Government...

Will the Internet Crash Democracy?
From Blog@Ubiquity

Will the Internet Crash Democracy?

Many people in the Western world believe Internet freedom equals freedom of social and political life. The more access we get, the more freedom and democracy we...

Are We Wrong About Innovation?
From Blog@Ubiquity

Are We Wrong About Innovation?

The notion that creating ideas and imagining new worlds fashioned around these ideas are the keys to innovation is all wrong. Ideation is not innovation The post...

The Self-Similarity of Tech
From Blog@Ubiquity

The Self-Similarity of Tech

The tech world is caught in a repeating, self-similar fractal, where the gadgets may be new, but the business models are as old as the Industrial Revolution itself...

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 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 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 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...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account