Abstract

In this paper we extend computability theory to the spaces of continuous, upper and lower semi-continuous real functions. We apply the framework of TTE, Type-2 Theory of Effectivity, where not only computable objects but also computable functions on the spaces can be considered. First some basic facts about TTE are summarized. For each of the function spaces, we introduce several natural representations based on different intiuitive concepts of “effectivity” and prove their equivalence. Computability of several operations on the function spaces is investigated, among others limits, mappings to open sets, images of compact sets and preimages of open sets, maximum and minimum values. The positive results usually show computability in all arguments, negative results usually express non-continuity. Several of the problems have computable but not extensional solutions. Since computable functions map computable elements to computable elements, many previously known results on computability are obtained as simple corollaries.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.