宁夏大学学报（自然科学版）2012，Vol.33Issue(1)：6-13,8.
分析中的可计算性
Computability in Analysis
摘要
Abstract
Credible computational methods and softwares are needed for plenty of computation problems in engineering and science. The usual floating-point representation is a basic approximation method of real numbers only. The different approximation methods would induced different computabilities for real numbers. The representation and knowledge of real numbers are the important basises researching computability in analysis. Klaus Weihrauch finds type-2 effective theory by introducing computable functions on infinite strings based on the type-2 Turing computation model. Many classical computable models on real numbers can be represented in type-2 effective theory. The representation system based on the alphabetis introduced to investigate the computability of elements in abstract set. For the representation of elements is normally a partly function or, called naming system. The different naming systems can induce different computabilities and effective topology spaces. The researches of computability in abstract spaces are naturally extended based on relations of topologies and naming systems.关键词
实数表示/第二型图灵机/命名系统/能行计算理论/能行拓扑空间Key words
representation of real number/ type-2 Turing machines naming system/ effective theory of computation/ effective topology space分类
信息技术与安全科学引用本文复制引用
许道云..分析中的可计算性[J].宁夏大学学报（自然科学版）,2012,33(1):6-13,8.基金项目
国家自然科学基金资助项目(60863005,61111130186) （60863005,61111130186）
