$\ell^p$的可计算副本的isometry度
The isometry degree of a computable copy of $\ell^p$
摘要:
当$p$是可计算实数,使得$p \geq 1$,$\ell^p$的可计算副本$\mathcal{B}$的等距度被定义为计算$\ell^p$到$\mathcal{B}$上的线性等距的最小幂图灵度。我们表明,这个程度总是存在的,当$p \neq 2$这些度正是c.e.度
英文摘要:
When $p$ is a computable real so that $p \geq 1$, the isometry degree of a computable copy $\mathcal{B}$ of $\ell^p$ is defined to be the least powerful Turing degree that computes a linear isometry of $\ell^p$ onto $\mathcal{B}$. We show that this degree always exists and that when $p \neq 2$ these degrees are precisely the c.e. degrees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。