Mind Matters Natural and Artificial Intelligence News and Analysis

TagNP-Complete (NPC) problems

communist-party-monument-pyongyang-north-korea-stockpack-adobe-stock.jpg
Communist Party Monument, Pyongyang, North-Korea

Computer Science Explains Why Communism Can’t Work

Successful communism is not only morally and practically flawed, it is mathematically impossible

Communism has been the target of many criticisms. The strongest deal with the mismatch between central planning and individuals’ desires for their lives and with the horrific human rights record of communist nations. Some scholars place the toll in human life due to communism at above 100 million in the 20th century. Those are criticisms of the practicality and ethics of communism. But is it also intrinsically flawed at a fundamental mathematical level? It turns out that the answer is yes. The basic idea behind central planning is this: If the central government makes most decisions that, in a freer society, individuals or small communities would make for themselves, more efficiency will follow—and, as a result, more prosperity. It doesn’t Read More ›

Shot of Corridor in Working Data Center Full of Rack Servers and Supercomputers with Internet connection Visualisation Projection.
Shot of Corridor in Working Data Center Full of Rack Servers and Supercomputers with Internet connection Visualization Projection.

What’s Hard for Computers Is Easy for Humans

Some of the surprising things computers have a hard time doing and why

We often hear that what’s hard for humans is easy for computers. But it turns out that many kinds of problems are exceedingly hard for computers to solve. This class of problems, known as NP-Complete (NPC), was independently discovered by Stephen Cook and Leonid Levin.

Read More ›