
TagLeonid Levin


What’s Hard for Computers Is Easy for Humans
Some of the surprising things computers have a hard time doing and whyWe 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 ›
Math Shows Why the Mind Is Not Just a Formula
The Liar’s Paradox shows that even mathematics cannot be reduced to a fixed set of axiomsGödel’s discovery brought back a sense of wonder to mathematics and to the rest of human knowledge. His incompleteness theorem underlies the fact that human investigation can never exhaust all that can be known. Every discovery builds a path to a new discovery.
Read More ›