Sequential Abstract-State Machines Capture Sequential Algorithms

Abstract

We examine sequential algorithms and formulate a sequential-time postulate, an abstractstatepostulate, and a bounded-exploration postulate. Analysis of the postulates leads us tothe notion of sequential abstract-state machine and to the theorem in the title. First we treatsequential algorithms that are deterministic and noninteractive. Then we consider sequentialalgorithms that may be nondeterministic and that may interact with their environments. © 2000, ACM. All rights reserved.