在取消草地上进行总计算的直线指令序列完备性
Straight-line instruction sequence completeness for total calculation on cancellation meadows
摘要：
结合程序代数与理论的草地设计导致理论的计算代数结构使用除了零测试和复制指令的指令集$\{x \Leftarrow 0, x \Leftarrow 1, x\Leftarrow -x, x\Leftarrow x^{-1}, x\Leftarrow x+y, x\Leftarrow x\cdot y\}$。本文证明了在消去草地上的全函数可以用最多5个辅助变量的直线程序来计算。一个类似的结果是获得签署草甸。
英文摘要：
A combination of program algebra with the theory of meadows is designed leading to a theory of computation in algebraic structures which use in addition to a zero test and copying instructions the instruction set $\{x \Leftarrow 0, x \Leftarrow 1, x\Leftarrow -x, x\Leftarrow x^{-1}, x\Leftarrow x+y, x\Leftarrow x\cdot y\}$. It is proven that total functions on cancellation meadows can be computed by straight-line programs using at most 5 auxiliary variables. A similar result is obtained for signed meadows.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
