arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1407.3624math.LO
收藏

失落旋律现象

The Lost Melody Phenomenon

Merlin Carl

AI总结:

本文研究了无限时间 Turing 机中真实数的可计算性与可识别性关系,证明了在无重置无限时间寄存器机中可识别性等于可计算性,即不存在失落旋律现象,并探讨了其他机器模型中该现象的存在性。

摘要:

无限时间 Turing 机模型中的一种典型现象是所谓的失落旋律现象,即存在一些实数 x,使得集合 {x} 的特征函数是可计算的,而 x 本身却不可计算(具有这种性质的实数称为可识别)。这一现象最初由 J. D. Hamkins 和 A. Lewis 在无限时间 Turing 机中观察到,随后由 P. Koepke 和作者在 ITRM 中得到验证。本文证明,在由 P. Koepke 引入的无重置无限时间寄存器机中,可识别性等于可计算性,即不存在失落旋律现象。然后,我们概述了在 ITRM 中可识别实数行为的研究结果。我们显示,在无参数的序数 Turing 机或序数寄存器机中不存在失落旋律现象,并且在假设 0# 存在的情况下,这一结论在 ZFC 中是独立的。最后,我们介绍了重置和无重置 α-寄存器机的概念,并讨论了这些机器中是否存在失落旋律现象的问题。

英文摘要:

A typical phenomenon for machine models of transfinite computations is the existence of so-called lost melodies, i.e. real numbers $x$ such that the characteristic function of the set $\{x\}$ is computable while $x$ itself is not (a real having the first property is called recognizable). This was first observed by J. D. Hamkins and A. Lewis for infinite time Turing machine, then demonstrated by P. Koepke and the author for $ITRM$s. We prove that, for unresetting infinite time register machines introduced by P. Koepke, recognizability equals computability, i.e. the lost melody phenomenon does not occur. Then, we give an overview on our results on the behaviour of recognizable reals for $ITRM$s. We show that there are no lost melodies for ordinal Turing machines or ordinal register machines without parameters and that this is, under the assumption that $0^{\sharp}$ exists, independent of $ZFC$. Then, we introduce the notions of resetting and unresetting $α$-register machines and give some information on the question for which of these machines there are lost melodies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑