EATCS Award to Valiant

by Brian Hayes

Published 15 February 2008

Leslie G. Valiant, whose work on holographic algorithms was the subject of a recent column in American Scientist and a brief note here on bit-player, has won the 2008 EATCS Award of the European Association for Theoretical Computer Science. In addition to the work on holographic algorithms, the EATCS cites Valiant’s contributions of computational learning theory, neuroscience, and several areas of complexity theory, including the study of enumeration problems.

Tags for this article: computing.

Publication history

First publication: 15 February 2008

Converted to Eleventy framework: 22 April 2025

More to read...

The Teetering Towers of Abstraction

Abstraction is an abstraction. You can’t touch it or taste it or photograph it. Yet this ghostly concept is an essential tool in both mathematics and computer science.

Counting Sums and Differences

On a research-level math problem that seems to involve nothing more exotic than counting, adding, and subtracting.

Does Having Prime Neighbors Make You More Composite?

Between the prime numbers 59 and 61 lies 60, which has an extraordinary abundance of divisors. Is that just a coincidence?

We Gather Together…

At the Thanksgiving table I thought I heard someone ask, “Please pass the Covid.”