Abstract State Machine
A high-level formal specification method for precisely characterizing algorithms and computational systems, proposed by Yuri Gurevich and based on model theory and state transition systems.
Timeline (last 90 days)
Gurevich summarizes abstract state machines as three postulates, of which the third postulate (the bounded exploration postulate) took about 15 years to take shape.
In an early paper on abstract state machines, Gurevich wrote that "non-deterministic algorithm" is a self-contradictory phrase.
All Facts (2)
Gurevich summarizes abstract state machines as three postulates, of which the third postulate (the bounded exploration postulate) took about 15 years to take shape.
50%UnverifiedIn an early paper on abstract state machines, Gurevich wrote that "non-deterministic algorithm" is a self-contradictory phrase.
50%