When p is a computable real so that p≥1, the isometry degree of a
computable copy B of â„“p is defined to be the least powerful
Turing degree that computes a linear isometry of â„“p onto B.
We show that this degree always exists and that when pî€ =2 these degrees
are precisely the c.e. degrees