| 关于实数的可计算性 |
| |
| 引用本文： | 陈传波,何大华.关于实数的可计算性[J].微电子学与计算机,2003,20(5):68-70. |
| |
| 作者姓名： | 陈传波 何大华 |
| |
| 作者单位： | 华中科技大学计算机学院,武汉,430074 |
| |
| 摘 要： | 给出了图灵机和可计算数之间的关系和可计算数的若干性质，提出了半可计算数的概念，并在此基础上结合集合的算术层次对实数集进行了算术分层，这一思想对于从可计算性角度理解实数具有借鉴意义。
|
| 关 键 词： | 可计算性理论 实数 图灵机 递归可枚举 编码 |
| 修稿时间： | 2003年10月14 |
On the computability of real numbers |
| |
| CHEN Chuan bo,HE Da hua.On the computability of real numbers[J].Microelectronics & Computer,2003,20(5):68-70. |
| |
| Authors: | CHEN Chuan bo HE Da hua |
| |
| Abstract: | The relationships between Turing Machine and computable number are described and some properties of computable number are given, a new concept called partially computable number is proposed in this paper, based on these, the real number set is divided into arithmetic hierarchies according to the basic arithmetic hierarchy theory, this idea may be helpful to understand real numbers in the opinion of computability. |
| |
| Keywords: | real number computability recursively enumerable algorithm Turing Machine |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
