Abstract
The Jordan Decomposition Theorem says that any real function of bounded variation can be expressed as a difference of two increasing functions. This paper investigates the effective version of Jordan decomposition and discusses the properties of variation of computable real functions. First we show that the effective version of Jordan decomposition does not hold in general. Then we give a sufficient and necessary condition for computable real functions of bounded variation which have an effective Jordan decomposition. Applying this condition, we construct a computable real function which has a computable modulus of absolute continuity (hence of bounded variation) but is not effectively Jordan decomposable. Finally, we prove a version of this result restricted to polynomial time which answers negatively an open question of Ko in [8].
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.
