Effective Banach spaces
classification
🧮 math.LO
math.FA
keywords
computabilityanalysisbanachstructureaddressesalmostbookbounded
read the original abstract
This thesis addresses Pour-El and Richards' fourth question from their book "Computability in analysis and physics", concerning the relation between higher order recursion theory and computability in analysis. Among other things it is shown that there is a computability structure that is uncountable. The example given is a structure on the Banach space of bounded linear operators on the set of almost periodic functions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.