computer science

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.

Cryptographers want to know which of five possible worlds we inhabit, which will reveal whether truly secure cryptography is even possible.

Language processing programs are notoriously hard to interpret, but smaller versions can provide important insights into how they work.

For centuries, mathematicians have tried to prove that Euler’s fluid equations can produce nonsensical answers. A new approach to machine learning has researchers betting that “blowup” is near.

The existence of secure cryptography depends on one of the oldest questions in computational complexity.

Traditional algorithms power complicated computational tools like machine learning. A new approach, called algorithms with predictions, uses the power of machine learning to improve algorithms.

A simple algorithm that revolutionizes how neural networks approach language is now taking on image classification as well. It may not stop there.

A new computer program fashioned after artificial intelligence systems like AlphaGo has solved several open problems in combinatorics and graph theory.