指令序列处理运算符
Instruction sequence processing operators
摘要：
教学序列是教学实践中的一个重要概念，但在理论界尚未引起足够的重视。本文涉及指令序列，由他们执行下产生的行为，这些行为之间的相互作用和组件的执行环境，和两个问题有关的可计算性理论。将图灵关于停机问题的不可判定性的结果定位于程序而不是机器，并将指令序列看作程序，分析了某类程序必须解决该类所有程序停机问题的可自解性要求.我们提出了新的结果，关于这个自解性的要求。通过使用功能单元的概念来简化分析，功能单元是机器的抽象的基于状态的模型。在执行环境的组件所表现出的行为可以被视为机器在其不同状态下的行为的情况下，所涉及的行为完全由功能单元确定。上述分析涉及功能单元，其可能的状态表示具有特定带字母表的图灵机的带的可能内容。我们还调查功能单位的可能状态是自然数。这项研究产生了一个新的可计算性的结果，即存在一个普遍的可计算的功能单位的自然数。
英文摘要：
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the picture in theoretical circles. This paper concerns instruction sequences, the behaviours produced by them under execution, the interaction between these behaviours and components of the execution environment, and two issues relating to computability theory. Positioning Turing's result regarding the undecidability of the halting problem as a result about programs rather than machines, and taking instruction sequences as programs, we analyse the autosolvability requirement that a program of a certain kind must solve the halting problem for all programs of that kind. We present novel results concerning this autosolvability requirement. The analysis is streamlined by using the notion of a functional unit, which is an abstract state-based model of a machine. In the case where the behaviours exhibited by a component of an execution environment can be viewed as the behaviours of a machine in its different states, the behaviours concerned are completely determined by a functional unit. The above-mentioned analysis involves functional units whose possible states represent the possible contents of the tapes of Turing machines with a particular tape alphabet. We also investigate functional units whose possible states are the natural numbers. This investigation yields a novel computability result, viz. the existence of a universal computable functional unit for natural numbers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
