We care about your data, and we'd like to use cookies to give you a smooth browsing experience. Please agree and read more about our privacy policy.

What's up in

Christopher Kanan is building algorithms that can continuously learn over time — the way we do.

Three computer scientists have posted a proof of the NLTS conjecture, showing that systems of entangled particles can remain difficult to analyze even away from extremes.

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?

Previous