无记忆矩阵群计算
Computing in matrix groups without memory
摘要:
无记忆计算是一种新颖的计算方法,通过每次更新一个寄存器而不使用存储器来计算一组寄存器的任何函数。我们的目标是模拟如何在现代核心上执行计算,因为它们通常涉及单个寄存器的更新。无记忆计算的计算模型可以用变换半群来表示,在双射函数的情况下,可以用置换群来表示。在本文中,我们认为寄存器作为一个有限域的元素,我们计算线性排列没有记忆。我们首先确定一个线性函数的最大复杂度时,只允许线性指令。我们还确定哪些线性函数是最难计算时,有关的字段是二进制字段和寄存器的数量是偶数。其次,我们研究了一些矩阵群,从而证明了特殊的线性群是内部可计算的,但不是快速的。第三,我们确定了生成特殊线性群和一般线性群所需的最小指令集。这些结果对于无记忆计算很重要,因为它们表明线性函数可以非常快地计算,或者计算任何线性函数只需要很少的指令。因此,它们表明使用无记忆计算的新优点。
英文摘要:
Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they typically involve updates of single registers. The computation model of memoryless computation can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we view registers as elements of a finite field and we compute linear permutations without memory. We first determine the maximum complexity of a linear function when only linear instructions are allowed. We also determine which linear functions are hardest to compute when the field in question is the binary field and the number of registers is even. Secondly, we investigate some matrix groups, thus showing that the special linear group is internally computable but not fast. Thirdly, we determine the smallest set of instructions required to generate the special and general linear groups. These results are important for memoryless computation, for they show that linear functions can be computed very fast or that very few instructions are needed to compute any linear function. They thus indicate new advantages of using memoryless computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。