Yale University Professor Yuri Matiyasevich has won a Gödel Prize for his groundbreaking work on Hilbert’s Tenth Problem. The Gödel Prize is considered one of the most prestigious awards in theoretical computer science.

Matiyasevich’s research solves Hilbert’s Tenth Problem, which asks if there is an algorithm that can decide whether a given Diophantine equation (an equation with integer coefficients and variables) has a solution in integers. Matiyasevich’s proof shows that there is no such algorithm, which is a significant result in theoretical computer science.

“Matiyasevich’s work is a major breakthrough in theoretical computer science,” said Yale Computer Science Professor Joan Feigenbaum. “He has shown that there are some problems that computers cannot solve, even in principle. This has profound implications for the field of computer science and our understanding of the limits of computation.”

The Gödel Prize is awarded annually by the Association of Symbolic Logic to recognize outstanding achievements in theoretical computer science. Matiyasevich is the first Yale faculty member to win the Gödel Prize.

“I am honored and grateful to receive this award,” said Matiyasevich. “I am proud of the work that I have done and I am glad that it has been recognized by the Association of Symbolic Logic.”

Matiyasevich will receive the Gödel Prize at the ASL’s annual meeting in San Diego in July.