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

反射算法的行为理论I:反射顺序算法

Behavioural Theory of Reflective Algorithms I: Reflective Sequential Algorithms

Klaus-Dieter Schewe, Flavio Ferrarotti

摘要:

我们开发了一个行为理论的反射顺序算法(RSA),即顺序算法,可以修改自己的行为。该理论包括一组独立于语言的假设定义类的RSA,一个抽象的机器模型,并证明所有的RSA被捕获的机器模型。在古列维奇的行为理论的顺序算法的RSA是顺序时间,有界的并行算法,其中的界限只取决于算法,而不是输入。与顺序算法不同的是,RSA的每个状态都包括该状态下算法的表示,从而实现语言反射。使用项作为值来保留有界探索。反射顺序抽象状态机(reflective sequential abstract state machines,rsASM)的模型使用扩展状态来扩展顺序ASM,扩展状态包括要由处于该状态的机器执行的主ASM规则的可更新表示。ASM签名和规则的表示更新是通过复杂的树代数实现的。

英文摘要:

We develop a behavioural theory of reflective sequential algorithms (RSAs), i.e. sequential algorithms that can modify their own behaviour. The theory comprises a set of language-independent postulates defining the class of RSAs, an abstract machine model, and the proof that all RSAs are captured by this machine model. As in Gurevich's behavioural theory for sequential algorithms RSAs are sequential-time, bounded parallel algorithms, where the bound depends on the algorithm only and not on the input. Different from the class of sequential algorithms every state of an RSA includes a representation of the algorithm in that state, thus enabling linguistic reflection. Bounded exploration is preserved using terms as values. The model of reflective sequential abstract state machines (rsASMs) extends sequential ASMs using extended states that include an updatable representation of the main ASM rule to be executed by the machine in that state. Updates to the representation of ASM signatures and rules are realised by means of a sophisticated tree algebra.

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

↑