随机存取机器程序的程序代数
Program algebra for random access machine programs
摘要：
本文提出了以随机存取机（RAM）指令为基本指令的指令序列的代数理论，讨论了指令序列在执行过程中所产生的行为，以及这些行为与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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
