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.

翻译：在文章“序列抽象国家机器捕捉序列算法”中,我们中的一位通过三个假设(顺序时间、抽象状态和受约束勘探假设)进行分解的序列算法。 在这里,我们给出了更抽象的封闭勘探假设版本,其精神更接近于抽象状态假设。 在出现相继时间和抽象状态假设时,我们的假设相当于最初受约束勘探假设。