Sequential abstract-state machines capture sequential algorithms

@article{Gurevich2000SequentialAM,
  title={Sequential abstract-state machines capture sequential algorithms},
  author={Y. Gurevich},
  journal={ACM Trans. Comput. Log.},
  year={2000},
  volume={1},
  pages={77-111}
}
  • Y. Gurevich
  • Published 2000
  • Computer Science
  • ACM Trans. Comput. Log.
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. 
Concurrent abstract state machines
TLDR
The semantics of concurrent ASMs are defined by concurrent ASM runs which overcome the problems of Gurevich's distributed ASM Runs and generalize Lamport's sequentially consistent runs to form a postulate characterizing an intuitive understanding of concurrency. Expand
Abstract state machines capture parallel algorithms
TLDR
It is shown that every parallel, synchronous algorithm can be simulated, step for step, by an abstract state machine with a background that provides for multisets. Expand
Sequential algorithms and the computational content of classical proofs
TLDR
A computational interpretation of the rule of dependent choice is developed which is phrased purely on the level of algorithms, giving a clearer insight into the computational meaning of proofs in classical analysis. Expand
On Bounded Exploration and Bounded Nondeterminism
This report consists of two separate parts, essentially two oversized footnotes to the article "Sequential Abstract State Machines Capture Sequential Algorithms" by Yuri Gurevich. In Chapter I, YuriExpand
A Verification Approach for Distributed Abstract State Machines
  • R. Eschbach
  • Computer Science
  • Ershov Memorial Conference
  • 2001
TLDR
This paper shows how a transition level in form of a transition graph may be constructed and can be carried out directly on the transition graph to prove properties related to the state transition level induced by partially ordered runs. Expand
Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking
We describe a prototype of a simulator for reactive timed abstract state machines (ASM) that checks whether the generated runs verify a requirements specification represented as a formula of a FirstExpand
A Behavioural Theory of Recursive Algorithms
TLDR
An axiomatic definition of the notion of sequential recursive algorithm is proposed which extends Gurevich's axioms for sequential algorithms by a Recursion Postulate and allows us to prove that sequential recursive algorithms are captured by recursive Abstract State Machines, an extension of nd-seq ASMs by a CALL rule. Expand
The Expressive Power of Abstract-State Machines
  • W. Reisig
  • Computer Science
  • Comput. Artif. Intell.
  • 2003
TLDR
The Abstract-State Machine model is characterized as a special class of transition systems that widely extends the class of "computable" transition systems. Expand
A Behavioural Theory of Recursive Algorithms
TLDR
A language-independent definition of the notion of recursive algorithm generalising Gurevich’s postulates is proposed, and it is proved that recursive algorithms are captured by recursive Abstract State Machines. Expand
A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
TLDR
It is shown that every effective algorithm can be efficiently simulated by a Turing machine, and emulating an effective algorithm via an abstract state machine by a random access machine, representing data as a minimal term graph. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 59 REFERENCES
Recursive Abstract State Machines
TLDR
This work suggests recursive ASMs, which are essentially a Gurevich abstract state machine and capture recursion properly in the sequential version of the ASM thesis. Expand
Time-bounded random access machines
TLDR
This paper introduces a formal model for random access computers and argues that the model is a good one to use in the theory of computational complexity and shows the existence of a time complexity hierarchy which is finer than any standard abstract computer model. Expand
The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs
TLDR
The Linear Time Hierarchy Theorems for random access machines and Gurevich abstract state machines are proved and lower bounds for natural linear time problems are proved. Expand
The Sequential ASM Thesis
  • Y. Gurevich
  • Computer Science, Mathematics
  • Bull. EATCS
  • 1999
The thesis is that every sequential algorithm, on any level of abstraction, can be viewed as a sequential abstract state machine. Abstract state machines (ASMs) used to be called evolving algebras.Expand
High Level System Design and Analysis Using Abstract State Machines
TLDR
The ASM approach is non-monolithic and integratable at any development level into current design and analysis environments, and enhances traditional operational modelling and analysis techniques. Expand
Choiceless Polynomial Time
TLDR
This work attempts to capture the choiceless fragment of PTime, a version of abstract state machines (formerly called evolving algebras) that is to replace arbitrary choice with parallel execution and is more expressive than other PTime logics in the literature. Expand
Kolmogoroff algorithms are stronger than turing machines
A predicate is constructed which is recognizable in real time by a Kolmogoroff algorithm but which is not recognizable in real time by a machine with polynomial accessibility.
Church's Thesis and Principles for Mechanisms
TLDR
It is argued that Turing's analysis of computation by a human being does not apply directly to mechanical devices, and it is proved that if a device satisfies the principles then its successive states form a computable sequence. Expand
Storage Modification Machines
TLDR
This paper gives a complete description of the SMM model and its real time equivalence to the so-called successor RAMS and shows the existence of an SMM that performs integer-multiplication in linear time. Expand
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. AbbreviatedExpand
...
1
2
3
4
5
...