Sequential abstract-state machines capture sequential algorithms
Top Cited Papers
- 1 July 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 1 (1), 77-111
- https://doi.org/10.1145/343369.343384
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.Keywords
This publication has 8 references indexed in Scilit:
- Choiceless polynomial timeAnnals of Pure and Applied Logic, 1999
- Kolmogorov and mathematical logicThe Journal of Symbolic Logic, 1992
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Kolmogoroff algorithms are stronger than turing machinesJournal of Mathematical Sciences, 1980
- Storage Modification MachinesSIAM Journal on Computing, 1980
- Church's Thesis and Principles for MechanismsPublished by Elsevier BV ,1980
- Time bounded random access machinesJournal of Computer and System Sciences, 1973
- An Unsolvable Problem of Elementary Number TheoryAmerican Journal of Mathematics, 1936