computer science

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.

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.