Suppose p is a computable real so that p ≥ 1. It is shown that the halting set can compute a surjective linear isometry between any two computable copies of Rᵖ. It is also shown that this result is optimal in that when p /= 2 there are two computable copies of Rᵖ with the property that any oracle that computes a linear isometry of one onto the other must also compute the halting set. Thus, Rᵖ is ∆⁰-categorical and is computably categorical if and only if p = 2. It is also demonstrated that there is a computably categorical Banach space that is not a Hilbert space. These results hold in both the real and complex case
