Abstract

This chapter provides an overview of ɛ–entropy. It also presents the proof of a theorem relating the ɛ-entropy to the ɛ-capacity. The chapter presents a theorem that is particularly interesting on two counts: it demonstrates the advantage of knowing the function to be approximated to have bounded derivatives and provides an assessment of the complexity of functions of several variables. The particularly revealing implication of this theorem is that the magnitude of the task of approximating functions of several variables is comparable to that of approximating a function of one variable.

Full Text
Paper version not known

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.