The isometry degree of a computable copy of p
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.