Sequential abstract-state machines capture sequential algorithms


We examine sequential algorithms and formulate a sequential-time postulate, an abstract-state postulate, and a bounded-exploration postulate . Analysis of the postulates leads us to the notion of sequential abstract-state machine and to the theorem in the title. First we treat sequential algorithms that are deterministic and noninteractive. Then we consider… (More)
DOI: 10.1145/343369.343384


  • Presentations referencing similar topics