Yuri Gurevich
A computer scientist and founder of the theory of Abstract State Machines (ASMs). He has worked at Microsoft Research. His research areas include logic, algorithm theory, and the foundations of computer science.
Timeline (last 90 days)
Yuri Gurevich puts forward the core argument: a true algorithm is always deterministic, and so-called "non-determinism" is merely the result of the algorithm obtaining information through an external "oracle".
Gurevich believes that the core object of study in computer science is the algorithm.
Gurevich summarizes abstract state machines as three postulates, of which the third postulate (the bounded exploration postulate) took about 15 years to take shape.
Gurevich reformulates the probabilistic algorithm of the simplified Fermat primality test as: a deterministic algorithm that itself calls an oracle named `choose in` to obtain random numbers.
Gurevich treats operations such as the Hadamard gate and unitary transformations in Grover's search algorithm as oracle calls that return true, with the algorithm seeing only deterministic control flow.
In the late 1990s, Gurevich formed a team at Microsoft Research and developed Spec Explorer—a high-level executable specification tool based on abstract state machines.
Gurevich's oracle-pattern framework requires that an algorithm's behavioral guarantees depend on assumptions about the oracle's behavior, for example, the reliability of the Fermat test depends on the quality of the random source.
In an early paper on abstract state machines, Gurevich wrote that "non-deterministic algorithm" is a self-contradictory phrase.
All Facts (8)
Yuri Gurevich puts forward the core argument: a true algorithm is always deterministic, and so-called "non-determinism" is merely the result of the algorithm obtaining information through an external "oracle".
50%UnverifiedGurevich believes that the core object of study in computer science is the algorithm.
50%UnverifiedGurevich summarizes abstract state machines as three postulates, of which the third postulate (the bounded exploration postulate) took about 15 years to take shape.
50%UnverifiedGurevich reformulates the probabilistic algorithm of the simplified Fermat primality test as: a deterministic algorithm that itself calls an oracle named `choose in` to obtain random numbers.
50%UnverifiedGurevich treats operations such as the Hadamard gate and unitary transformations in Grover's search algorithm as oracle calls that return true, with the algorithm seeing only deterministic control flow.
50%UnverifiedIn the late 1990s, Gurevich formed a team at Microsoft Research and developed Spec Explorer—a high-level executable specification tool based on abstract state machines.
50%UnverifiedGurevich's oracle-pattern framework requires that an algorithm's behavioral guarantees depend on assumptions about the oracle's behavior, for example, the reliability of the Fermat test depends on the quality of the random source.
50%UnverifiedIn an early paper on abstract state machines, Gurevich wrote that "non-deterministic algorithm" is a self-contradictory phrase.
50%