What's up in

When divvying something up, there’s more than one way to define what’s fair.

Computer scientists have come up with a bounded algorithm that can fairly divide a cake among any number of people.

Computer scientists can prove certain programs to be error-free with the same certainty that mathematicians prove theorems.

Recent tests show that quantum computers made by D-Wave systems should solve some problems faster than ordinary computers. Researchers have begun to map out exactly which queries might benefit from these quantum machines.

The biological world is computational at its core, argues computer scientist Leslie Valiant.

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field.

The physical nature of computers might reveal deep truths about their uniquely powerful abstract abilities.

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof.

A major advance in computational complexity reveals deep connections between the classes of problems that computers can — and can’t — possibly do.