Chaitin Ω数与停机问题
Chaitin Ωnumbers and halting problems
摘要:
Chaitin [G. J. Chaitin,J. Assoc. Comput.马赫,vol.22,pp.329-340,1975]引入Ω数作为随机实数的一个具体例子。实Ω被定义为最优计算机停止的概率,其中最优计算机是用于定义程序大小复杂度概念的通用解码算法。蔡廷表明Ω是随机发现的财产,第一个n位的基地,两个扩展Ω解决停机问题的最佳计算机的所有二进制输入的长度最多n。在本文中,我们从各个方面研究这个属性。我们考虑了Ω的基2展开式与停机问题之间的相对计算能力,通过对这两个问题施加有限大小的限制。已知Ω的二进制展开式与停机问题是图灵等价的。因此,我们考虑以某种方式阐述图灵等价。
英文摘要:
Chaitin [G. J. Chaitin, J. Assoc. Comput. Mach., vol.22, pp.329-340, 1975] introduced Ωnumber as a concrete example of random real. The real Ωis defined as the probability that an optimal computer halts, where the optimal computer is a universal decoding algorithm used to define the notion of program-size complexity. Chaitin showed Ωto be random by discovering the property that the first n bits of the base-two expansion of Ωsolve the halting problem of the optimal computer for all binary inputs of length at most n. In the present paper we investigate this property from various aspects. We consider the relative computational power between the base-two expansion of Ωand the halting problem by imposing the restriction to finite size on both the problems. It is known that the base-two expansion of Ωand the halting problem are Turing equivalent. We thus consider an elaboration of the Turing equivalence in a certain manner.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。