Yuri Gurevich

Yuri Gurevich

Yuri Gurevich is an American computer scientist and the inventor of abstract state machines. He is currently 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. [Yuri Gurevich. Average case completeness. Journal of Computer and`System Sciences, 42:346–398, 1991.]

Gurevich is an ACM Fellow, a Guggenheim Fellow, a fellow of Academia Europaea, and Dr. Honoris Causa of Hasselt University in Belgium and of Ural State University in Russia.

External links

* [http://research.microsoft.com/~gurevich Gurevich's Microsoft Home page]

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Yuri Lutovinov — Yuri (Kharitonovich or Khrisanfovich) Lutovinov (1887 1924) was a Russian labor leader.Lutovinov was born in Lugansk. He started work in metals factories in the Donbas as a teenager, and joined the Bolshevik Party in 1904. Lutovinov also was an… …   Wikipedia

  • Mikoyan-Gurevich MiG-15 — MiG 15 MiG 15UTI Single seat MiG 15 of the Polish Air Force in Museum Uzbrojenia in Poznań Role Fighter …   Wikipedia

  • Mikoyan-Gurevich MiG-15 — MiG 15 MiG 15 de Polonia Tipo Caza Fabricante …   Wikipedia Español

  • Mikoyan-Gurevich MiG-21 operators — Operators of the MiG 21 (former operators in red) Contents 1 Current operators 1.1  Azerbaijan …   Wikipedia

  • Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… …   Wikipedia

  • Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… …   Wikipedia

  • Pointer machine — In theoretical computer science a pointer machine is an atomistic abstract computational machine model akin to the Random access machine.Depending on the type, a pointer machine may be called a linking automaton, a KU machine, an SMM, an… …   Wikipedia

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

  • Abstrakte Zustandsmaschine — Eine abstrakte Zustandsmaschine (englisch Abstract State Machine (ASM), nicht zu verwechseln mit Algorithmic state machines, ehemals auch Evolving Algebra (EVA) genannt), ist in der Informatik ein Modell zur formalen, operationellen Beschreibung… …   Deutsch Wikipedia

  • Algorithm examples — This article Algorithm examples supplements Algorithm and Algorithm characterizations. = An example: Algorithm specification of addition m+n =Choice of machine model:This problem has not been resolved by the mathematics community. There is no… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”