pith. sign in

arxiv: 1605.00641 · v4 · pith:RU7EPES7new · submitted 2016-05-02 · 🧮 math.LO

The isometry degree of a computable copy of ell^p

classification 🧮 math.LO
keywords degreecomputableisometrycopydegreesmathcalwhenalways
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.