广义实直线上的可计算分析
Towards computable analysis on the generalised real line
摘要:
在本文中,我们使用带长度为$κ$的无限图灵机,并且其运行时间为$κ$,例如,由Koepke \& Seyfferth提出,将第二类可计算性的概念推广到$2^κ$,其中$κ$是具有$κ^{<κ}=κ$的不可数基数。然后我们开始研究$\mathbb{R}_κ$的计算性质,它是基数$2^κ$的$\mathbb{R}$的实封闭的域扩张,由第一作者使用超实数定义,并被提出作为推广实分析的候选。特别是,我们介绍了表示的$\mathbb{R}_κ$下的字段操作是可计算的。最后,我们表明,这个框架是适合推广的经典Weihrauch层次。特别是我们开始研究的计算强度的广义版本的中值定理。
英文摘要:
In this paper we use infinitary Turing machines with tapes of length $κ$ and which run for time $κ$ as presented, e.g., by Koepke \& Seyfferth, to generalise the notion of type two computability to $2^κ$, where $κ$ is an uncountable cardinal with $κ^{<κ}=κ$. Then we start the study of the computational properties of $\mathbb{R}_κ$, a real closed field extension of $\mathbb{R}$ of cardinality $2^κ$, defined by the first author using surreal numbers and proposed as the candidate for generalising real analysis. In particular we introduce representations of $\mathbb{R}_κ$ under which the field operations are computable. Finally we show that this framework is suitable for generalising the classical Weihrauch hierarchy. In particular we start the study of the computational strength of the generalised version of the Intermediate Value Theorem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。