Abstract
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (so-called Jordan decomposition). The effective version of this result is not true. In this paper we give a sufficient and necessary condition for computable real functions which can be expressed as two computable increasing functions (effectively Jordan decomposable, or EJD for short). Using this condition, we prove further that there is a computable real function which has a computable modulus of absolute continuity but is not EJD. The polynomial time version of this result holds accordingly too and this gives a negative answer to an open question of Ko in [6].
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.
