ConceptBounded Exploration Postulate
Bounded Exploration Postulate
The third postulate of Abstract State Machine theory, formalizing the intuition that an algorithm examines only finite information at each step, characterizing state differences by bounded term sets and Boolean terms.
Timeline (last 90 days)
Oct 20
Gurevich summarizes abstract state machines as three postulates, of which the third postulate (the bounded exploration postulate) took about 15 years to take shape.
Unverified50%