A note on the computable categoricity of lp spaces

Abstract

Suppose p is a computable real so that p ≥ 1. We show that in both the real and complex case lp is computably categorical if and only if p ≠ 2.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…