The isometry degree of a computable copy of ℓ p 1
Computability(2019)
摘要
Suppose p is a computable real so that \(p \ge 1\). We define the isometry degree of a computable presentation of \(\ell ^p\) to be the least powerful Turing degree \(\mathbf {d}\) by which it is \(\mathbf {d}\)-computably isometrically isomorphic to the standard presentation of \(\ell ^p\). We show that this degree always exists and that when \(p \ne 2\) these degrees are precisely the c.e. degrees.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要