774 research outputs found

    The isometry degree of a computable copy of â„“p\ell^p

    Full text link
    When pp is a computable real so that p≥1p \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 p≠2p \neq 2 these degrees are precisely the c.e. degrees
    • …
    corecore