Affiliation:
1. Microsoft Research, Redmond, WA
Abstract
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 sequential algorithms that may be nondeterministic and that may interact with their environments.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference31 articles.
1. The linear time hierarchy theorem for RAMs and abstract state machines;BLASS A.;J. Univ. Comput. Sci.,1997
2. Choiceless polynomial time;BLASS A.;Ann. Pure Appl. Logic,1999
3. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines;BLUM L.;Bull. Am. Soc. Inf. Sci.,1989
Cited by
261 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献