论文标题
程序代数用于随机访问机程序
Program algebra for random access machine programs
论文作者
论文摘要
本文介绍了一个代数的指导序列理论，该序列具有随机访问机器（RAM）的指令，作为基本指令，执行中有关的指令序列产生的行为以及此类行为与RAM记忆之间的相互作用。该理论为理论开发的设置提供了一个在计算复杂性和算法分析等领域的发展，这些算法通过提供方程推理的可能性来区分自身，以确定指令序列是否计算给定功能和比任何已知版本的RAM计算模型提供的设置更一般性。在这种情况下，引入了该版本的RAM计算模型的半现实版本和面向位的时间复杂度度量。在相关时间量度下，可以通过二次时间开销的多磁带图灵机模拟半现实的公羊。
This paper presents an algebraic theory of instruction sequences with instructions for a random access machine (RAM) as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and RAM memories. This theory provides a setting for the development of theory in areas such as computational complexity and analysis of algorithms that distinguishes itself by offering the possibility of equational reasoning to establish whether an instruction sequence computes a given function and being more general than the setting provided by any known version of the RAM model of computation. In this setting, a semi-realistic version of the RAM model of computation and a bit-oriented time complexity measure for this version are introduced. Under the time measure concerned, semi-realistic RAMs can be simulated by multi-tape Turing machines with quadratic time overhead.
