11th Conference on Computability in Europe (CiE 2015)
Link to Published Version
June 29-July 3, 2015
Suppose that p is a computable real and that p >= 1. We show that in both the real and complex case, l(p) is computably categorical if and only if p = 2. The proof uses Lamperti's characterization of the isometries of Lebesgue spaces of sigma-finite measure spaces.
Springer International Publishing Switzerland
Timothy H. McNicholl. "A Note on the Computable Categoricity of l(p) Spaces" Bucharest, RomaniaLecture Notes in Computer Science
Vol. 9136 (2015) p. 268 - 275
Available at: http://works.bepress.com/timothy-mcnicholl/31/