Yuri Gurevich

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Yuri Gurevich at ETH Zurich in May 2004, photograph by Bertrand Meyer.

Yuri Gurevich is a Russian-American computer scientist and mathematician and the inventor of abstract state machines. He is Principal Researcher at Microsoft Research, where he founded the Foundations of Software Engineering group, and he is professor emeritus at the University of Michigan.

Gurevich was educated in the Soviet Union, and taught in Israel before coming to the United States. The best known work of his Soviet period is on the classical decision problem. In Israel, Gurevich worked with Saharon Shelah on monadic second-order theories. The Forgetful Determinacy Theorem of Gurevich-Harrington is of that period as well. As far as his American period is concerned, Gurevich is best known for his work on finite model theory and the theory of abstract state machines. He has also contributed to average-case complexity theory.[1]

Gurevich is an ACM Fellow,[2] a Guggenheim Fellow,[3] a member of Academia Europaea, and Dr. Honoris Causa of Hasselt University in Belgium and of Ural State University in Russia. In 2014 he became one of ten inaugural fellows of the European Association for Theoretical Computer Science.[4]

References[edit]

  1. ^ Yuri Gurevich. Average case completeness. Journal of Computer and`System Sciences, 42:346–398, 1991.
  2. ^ ACM Fellows, Association for Computing Machinery. Accessed February 16, 2010
  3. ^ Fellows List, John Simon Guggenheim Memorial Foundation. Accessed February 16, 2010
  4. ^ Aceto, Luca (March 5, 2014), "EATCS Fellows class of 2014 named", Process Algebra Diary .

External links[edit]