Abstract

We consider determinate functions with delay which are generalisations of determinate functions and introduce the notion of complexity of an ɛ-approximation of a continuous real function by a function with delay. For some classes of continuous functions for which estimates of the number of elements in the 2ɛ-distinguishable set of functions are known, upper and lower estimates are obtained.

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.