English

The isometry degree of a computable copy of $\ell^p$

Logic 2019-04-30 v4

Abstract

When pp is a computable real so that p1p \geq 1, the isometry degree of a computable copy B\mathcal{B} of p\ell^p is defined to be the least powerful Turing degree that computes a linear isometry of p\ell^p onto B\mathcal{B}. We show that this degree always exists and that when p2p \neq 2 these degrees are precisely the c.e. degrees.

Keywords

Cite

@article{arxiv.1605.00641,
  title  = {The isometry degree of a computable copy of $\ell^p$},
  author = {Timothy H. McNicholl and D. M. Stull},
  journal= {arXiv preprint arXiv:1605.00641},
  year   = {2019}
}