Computer Science

Computer scientists have found a new type of problem that quantum computers can solve dramatically faster than their classical counterparts.

Mark Braverman has spent his career translating thorny problems into the language of information complexity.

Intelligent beings learn by interacting with the world. Artificial intelligence researchers have adopted a similar strategy to teach their virtual agents new tricks.

Daniel Spielman solves important problems by thinking hard — about other questions.

Computer scientists can now solve a decades-old problem in practically the time it takes to write it down.

Physicists are building neural networks out of vibrations, voltages and lasers, arguing that the future of computing lies in exploiting the universe’s complex physical behaviors.

Why verify every line of a proof, when just a few checks will do?

Leslie Lamport revolutionized how computers talk to each other. Now he’s working on how engineers talk to their machines.

Finding out whether a question is too difficult to ever solve efficiently depends on figuring out just how hard it is. Researchers have now shown how to do that for a major class of problems.