研究了无穷计算的基本性质,引入基于相对可计算理论的过程模式可计算泛函概念。通过可计算性基本性质比较,证明了过程模式可计算泛函概念是部分递归泛函概念的扩展,即部分递归泛函类是过程模式可计算泛函类的真子集。
The basic properties of the infinite computation are studied. The concept of the procedure schemata computable functional based on the relative computability theory is introduced. Compared with the computability of the partial recursive functional, the procedure schemata computable functional is proved to' be an expansion of the partial recursive functional. This class of partial recursive functionals is a proper subclass of the procedure schemata computable functionals.