Pine Continuous Functions and Computable Analysis
Pine Continuous Functions and Computable Analysis
复制标题
Pine 连续函数和可计算分析
DOI:
--
复制
发表时间:
2007
期刊:
影响因子:
--
通讯作者:
Takakazu Mori
中科院分区:
文献类型:
--
作者:
Takakazu Mori
Computable Analysis is regarded widely as areconstruction of analysis “effectively” by defining every notions effectively such as computable numbers, computable functions and effective integrability. Many approaches of this attempt have taken place. An example is Type II computability with representation, developed by Weihrauch ([13]). This approach is based on the coding theory. Another example is computable metric spaces with acomputability structure, developed by Tsujii, Yasugi and Mori ([8], [15]) inheriting the preceding work of Pour-El and Richards ([9]). Roughly speaking, the latter approach simulates the usual analysis using effective convergence instead of usual convergence. Effective way means amethod based on the recursion theory. So, we assume the basic knowledge of recursion theory such as recursive functions. We start with the calculation of $sqrt{2}$ for the sake of the illustration of computable numbers.