arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2206.01032cs.SEcs.LO
收藏

一个更抽象的有界探索假设

A more abstract bounded exploration postulate

Yuri Gurevich, Tatiana Yavorskaya

摘要:

在“顺序抽象状态机捕获顺序算法“一文中,我们用三个公设:顺序时间公设、抽象状态公设和有界探索公设对顺序算法进行了公理化。在这里,我们给出了一个更抽象的版本的有界探索公设,这是更接近的精神抽象状态公设。在序列时间和抽象状态假设的存在下,我们的假设等价于原来的有界探索假设。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑