论文标题
一个更抽象的探索假设
A more abstract bounded exploration postulate
论文作者
论文摘要
在文章“顺序抽象机器捕获顺序算法”中，我们中的一个通过三个假设：顺序时间，抽象状态和有限的探索假设，通过公理化顺序算法。在这里，我们给出了一个有界探索假设的更抽象的版本，它在精神上更接近抽象状态。在存在顺序时间和抽象状态的情况下，我们的假设等同于原始有限的探索假设。
In article "Sequential abstract state machines capture sequential algorithms", one of us axiomatized sequential algorithms by means of three postulates: sequential time, abstract state, and bounded exploration postulates. Here we give a more abstract version of the bounded exploration postulate which is closer in spirit to the abstract state postulate. In the presence of the sequential time and abstract state postulates, our postulate is equivalent to the original bounded exploration postulate.
