关于连续实函数的弱可计算性
On the Weak Computability of Continuous Real Functions
摘要:
在可计算分析中,有效地收敛到实数x的有理数序列被用作x的(ρ-)名称。一个实数x是可计算的,如果它有一个可计算的名字,一个实函数f是可计算的,如果有一个图灵机M,它计算f,在这个意义上,M接受x的任何rho-名字作为输入,并输出f(x)的rho-名字,对于f的域中的任何x。通过弱化收敛的有效性要求和对有理序列的收敛速度进行分类,文献中引入了几类有趣的弱可计算实数,例如,除了可计算实数(EC)类之外,我们还有半可计算实数(SC)类、弱可计算实数(WC)类、发散有界可计算实数(DBC)类和可计算逼近实数(CA)类。本文对连续实函数的弱可计算性进行了研究,并尝试引入弱可计算实函数的类似分类。我们提出的定义,这些功能的图灵机,以及由序列的有理多边形,并证明这两个定义是不等价的。此外,我们探讨这些功能的性质,并在其他人,显示其封闭性下的算术运算和组合。
英文摘要:
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there is a Turing machine M which computes f in the sense that, M accepts any rho-name of x as input and outputs a rho-name of f(x) for any x in the domain of f. By weakening the effectiveness requirement of the convergence and classifying the converging speeds of rational sequences, several interesting classes of real numbers of weak computability have been introduced in literature, e.g., in addition to the class of computable real numbers (EC), we have the classes of semi-computable (SC), weakly computable (WC), divergence bounded computable (DBC) and computably approximable real numbers (CA). In this paper, we are interested in the weak computability of continuous real functions and try to introduce an analogous classification of weakly computable real functions. We present definitions of these functions by Turing machines as well as by sequences of rational polygons and prove these two definitions are not equivalent. Furthermore, we explore the properties of these functions, and among others, show their closure properties under arithmetic operations and composition.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。