Computer Science

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.

Seventy years after the invention of a data structure called a hash table, theoreticians have found the most efficient possible configuration for it.

Two mathematicians have shown that origami can, in principle, be used to perform any possible computation.

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it.

The Joy of Why podcast returns for a third season, with two co-hosts, 24 brilliant guests and 24 all-new episodes.

Far from being “stochastic parrots,” the biggest large language models seem to learn enough skills to understand the words they’re processing.

As computer-driven cars and planes become more common, the key to preventing accidents, researchers show, is to know what you don’t know.

Locally correctable codes need barely any information to fix errors, but they’re extremely long. Now we know that the simplest versions can’t get any shorter.