程序代数中布尔寄存器的指令集
On instruction sets for Boolean registers in program algebra
摘要：
在以前的工作中进行的程序代数的设置，包括工作在该地区的指令序列大小的复杂性，我们选择的指令集的布尔寄存器，只包含几个可能的种类的指令。本文研究了布尔寄存器所有可能指令集的指令序列大小有界函数完备性。我们期望，这项研究的结果将是有用的，充分评估的工作结果，关注的是指令序列大小复杂性的下限。
英文摘要：
In previous work carried out in the setting of program algebra, including work in the area of instruction sequence size complexity, we chose instruction sets for Boolean registers that contain only instructions of a few of the possible kinds. In the current paper, we study instruction sequence size bounded functional completeness of all possible instruction sets for Boolean registers. We expect that the results of this study will turn out to be useful to adequately assess results of work that is concerned with lower bounds of instruction sequence size complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
