一个可定义的数字，无法通过算法近似计算
A definable number which cannot be approximated algorithmically
摘要：
图灵机（TM）和丘奇命题已经形式化了可计算数的概念，这允许显示不可计算数。本文定义了TM“可接近”数的概念，并证明了某些（如果不是全部）已知的不可计算数是TM可接近的。然后给出了一个TM不可达数的例子。
英文摘要：
The Turing machine (TM) and the Church thesis have formalized the concept of computable number, this allowed to display non-computable numbers. This paper defines the concept of number "approachable" by a TM and shows that some (if not all) known non-computable numbers are approachable by TMs. Then an example of a number not approachable by a TM is given.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
