非标准分析的Gandy-Hyland泛函和迄今未知的计算问题
The Gandy-Hyland functional and a hitherto unknown computational aspect of Nonstandard Analysis
摘要:
在本文中,我们突出了一个新的计算方面的非标准分析有关高阶可计算性理论。特别是,我们证明了Gandy-Hyland功能等于一个原始的递归功能,涉及纳尔逊的内部集合论内的非标准数。从这个经典的和无效的证明非标准分析,一项从哥德尔的系统T计算的Gandy-Hyland功能方面的一个模的连续功能和特殊情况的风扇功能。我们得到了几个类似的相对可计算性结果不涉及非标准分析从其相关的非标准定理,特别是涉及弱连续性功能。通过反转的方式,我们表明,某些相对的可计算性结果,称为Herbrandisations,也意味着非标准定理,从那里得到它们。因此,我们在可计算性领域(特别是理论计算机科学)和非标准分析领域之间建立了直接的双向联系。
英文摘要:
In this paper, we highlight a new computational aspect of Nonstandard Analysis relating to higher-order computability theory. In particular, we prove that the Gandy-Hyland functional equals a primitive recursive functional involving nonstandard numbers inside Nelson's internal set theory. From this classical and ineffective proof in Nonstandard Analysis, a term from Goedel's system T is extracted which computes the Gandy-Hyland functional in terms of a modulus-of-continuity functional and a special case of the fan functional. We obtain several similar relative computability results not involving Nonstandard Analysis from their associated nonstandard theorems, in particular involving the weak continuity functional. By way of reversal, we show that certain relative computability results, called Herbrandisations, also imply the nonstandard theorem from whence they were obtained. Thus, we establish a direct two-way connection between the field Computability (in particular theoretical computer science) and the field Nonstandard Analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。