We demonstrate that, within any computable presentation of the Banach space , computing is no harder than computing the halting set. Additionally, we prove that the modulus operator is -computable and use this to show that is -categorical when we restrict ourselves to the presentations in which at least one homeomorphism of the unit interval onto itself is computable.
C.J.Ash and J.Knight, Computable Structures and the Hyperarithmetical Hierarchy, Studies in Logic and the Foundations of Mathematics, Vol. 144, North-Holland Publishing Co., Amsterdam, 2000.
2.
T.Brown, Computable structure theory on Banach spaces, Graduate theses and dissertations, Iowa State University, 2019.
3.
T.Brown and T.H.McNicholl, Analytic computable structure theory and -spaces part 2, Arch. Math. Logic59 (2020), 427–443. doi:10.1007/s00153-019-00697-4.
4.
J.Clanin, T.McNicholl and D.Stull, Analytic computable structure theory and -spaces, Fundamenta Mathematicae. 244 (2019), 255–285. doi:10.4064/fm448-5-2018.
5.
M.P.H.Fabian, P.Hájek, V.Montesinos and V.Zizler, Banach Space Theory, the Basis for Linear and Nonlinear Analysis, CMS Books in Mathematics, 2011.
6.
R.J.Fleming and J.E.Jamison, Isometries on Banach Spaces: Function Spaces, Monographs and Surveys in Pure and Applied Mathematics, CRC Press, 2002.
7.
E.B.Fokina, V.Harizanov and A.G.Melnikov, Computable model theory, in: Turing’s Legacy: Developments from Turing’s Ideas in Logic, R.Downey, ed., Cambridge University Press, Cambridge, 2014.
8.
E.B.Fokina, I.Kalimullin and R.Miller, Degrees of categoricity of computable structures, Archive for Mathematical Logic49(1) (2009), 51–67. doi:10.1007/s00153-009-0160-4.
9.
A.Fröhlich and J.C.Shepherdson, Effective procedures in field theory, Philosophical Transactions of the Royal Society of London. Series A. Mathematical and Physical Sciences248 (1956), 407–432.
10.
D.R.Hirschfeldt, K.Kramer, R.Miller and A.Shlapentokh, Categoricity properties for computable algebraic fields, Transactions of the American Mathematical Society367(6) (2015), 3981–4017. doi:10.1090/S0002-9947-2014-06094-7.
11.
T.H.McNicholl, Computable copies of , Computability6(4) (2017), 391–408. doi:10.3233/COM-160065.
12.
A.G.Melnikov and K.M.Ng, Computable structures and operations on the space of continuous functions, Fundamenta Mathematicae233(2) (2014), 1–41.
13.
A.G.Melnikov and A.Nies, The classification problem for compact computable metric spaces, in: The Nature of Computation, Lecture Notes in Comput. Sci., Vol. 7921, Springer, Heidelberg, 2013, pp. 320–328.
14.
C.Pilar and J.Mendoza, Banach Spaces of Vector-Valued Functions, Lecture Notes in Mathematics, Vol. 1676, Springer-Verlag, Berlin, 1997. MR 1489231.
15.
M.B.Pour-El and I.Richards, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer Verlag, Berlin, New York, 1989.
16.
R.Soare, Turing Computability Theory and Applications, Springer, Berlin, Heidelberg, 2016.
17.
K.Weihrauch, Computable Analysis: An Introduction, Texts in Theoretical Computer Science, Springer, Berlin, New York, 2000.
