Abstract
This chapter is devoted to representations of continuous functions and to applications of the concepts introduced so far. In Sect. 6.1 we define and discuss several representations of spaces of continuous real functions, in particular, representations via names of realizing programs, the “compact-open” representations and the representations by uniform approximation with rational polygons. In Sect. 6.2 we prove computability of any standard operations on functions, closed, open and compact sets. In particular, we prove a computable version of Urysohn’s lemma for closed subsets of ℝn. Computability of zero-finding for real functions under various restrictions is discussed in Sect. 6.3. Sect. 6.4 is devoted to computability problems of differentiation and integration, and Sect. 6.5 contains some further results on analytic functions.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
