The isometry degree of a computable copy of $\ell^p$
Logic
2019-04-30 v4
Abstract
When is a computable real so that , the isometry degree of a computable copy of is defined to be the least powerful Turing degree that computes a linear isometry of onto . We show that this degree always exists and that when 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}
}