2012/07/27 by Bjørn Kjos-Hanssen, Kjos-Hanssen, Bjørn
Computer Science · Mathematics · #03D #Cellular Automata and Applications #Computability, Logic, AI Algorithms #FOS: Mathematics #Functional Analysis (math.FA) #Logic (math.LO) #math.FA #math.LO #msc:03D
paper · pdf · doi:10.48550/arxiv.1207.6622
Master's thesis, University of Oslo, 1997. Adviser: Dag Normann. Translated from Norwegian. Original title: "Effektive Banach-rom"
arxiv created 2012/07/27 · openalex publication_date 2012/07/27 · arxiv updated 2012/07/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.