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...

A Glitch in the Maptrix

Is the world we live in a solid mass of stone and iron, or is it just pixels all the way down? Mapping apps seem to offer a peek behind the façade.

Words for the Wordle-Weary

Can a computer program beat your score at Wordle? I don’t know, but it can beat mine.

600613

Pick a number, N, then try searching for it on the web via Bing or Google (or maybe the leet version of Google).

The Short Arm of Coincidence

Can a factorial number cozy up to a perfect square, so that \(n! + 1 = m^2\)? Three examples are known. Are there more? The answer is a definite maybe.