Computability · 2016 · 21 citations · 3 references
ComputingComputer ScienceMathematicsAlgorithmsSet TheoryTheory Of ComputationComputability TheoryLinear AlgebraLinear Isomorphisms
Suppose p is a computable real so that [Formula: see text]. It is shown that the halting set can compute a surjective linear isometry between any two computable copies of [Formula: see text]. It is also shown that this result is optimal in that when [Formula: see text] there are two computable copies of [Formula: see text] with the property that any oracle that computes a linear isometry of one onto the other must also compute the halting set. Thus, [Formula: see text] is [Formula: see text]-categorical and is computably categorical if and only if [Formula: see text]. 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.
3
On the isometries of certain function-spaces
John Lamperti · Pacific Journal of Mathematics · 1958 · 346 citations · Full text
Alexander Melnikov · Journal of Symbolic Logic · 2013 · 61 citations