Computer Science

The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more.

Russell Impagliazzo studies hard problems, the limits of cryptography, the nature of randomness and more.

In the search for the most scalable hardware to use for quantum computers, qubits made of individual atoms are having a breakout moment.

Large language models do better at solving problems when they show their work. Researchers are beginning to understand why.

Researchers have shown that a problem relating to the energy of a quantum system is easy for quantum computers but hard for classical ones.

By eliminating a hidden inefficiency, computer scientists have come up with a new way to multiply large matrices that’s faster than ever.

Erasing key information during training results in machine learning models that can learn new languages faster and more easily.

Two researchers have proved that Penrose tilings, famous patterns that never repeat, are mathematically equivalent to a kind of quantum error correction.

A new study suggests that so-called emergent abilities actually develop gradually and predictably, depending on how you measure them.