Ω-stability,omega-stability

In this paper we discuss the stability of ω-Turing machines and give a definition for ω-computable functions defined on the set of all infinite strings of a finite alphabet.

在这篇文章里我们讨论ω-Turing机的稳定性并且定义了在一个有限字母表的全体无限序列上的ω-可计算函数,我们也证明了ω-可计算函数的复合函数也是ω-可计算的。