Affiliation:
1. University of Michigan, Ann Arbor, MI
2. Microsoft Research, Redmond, WA
Abstract
This is the second in a series of three articles extending the proof of the Abstract State Machine Thesis---that arbitrary algorithms are behaviorally equivalent to abstract state machines---to algorithms that can interact with their environments during a step, rather than only between steps. As in the first article of the series, we are concerned here with ordinary, small-step, interactive algorithms. This means that the algorithms:
(1) proceed in discrete, global steps,
(2) perform only a bounded amount of work in each step,
(3) use only such information from the environment as can be regarded as answers to queries, and
(4) never complete a step until all queries from that step have been answered.
After reviewing the previous article's formal description of such algorithms and the definition of behavioral equivalence, we define ordinary, interactive, small-step abstract state machines (ASMs). Except for very minor modifications, these are the machines commonly used in the ASM literature. We define their semantics in the framework of ordinary algorithms and show that they satisfy the postulates for these algorithms.
This material lays the groundwork for the final article in the series, in which we shall prove the Abstract State Machine thesis for ordinary, intractive, small-step algorithms: All such algorithms are equivalent to ASMs.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Software science view on quantum circuit algorithms;Information and Computation;2023-06
2. The Generic Model of Computation;Electronic Proceedings in Theoretical Computer Science;2012-07-30
3. Turing Meets Milner;Lecture Notes in Computer Science;2012
4. Persistent queries in the behavioral theory of algorithms;ACM Transactions on Computational Logic;2011-01
5. When are Two Algorithms the Same?;The Bulletin of Symbolic Logic;2009-06