Effectively Absolute Continuity and Effective Jordan Decomposability

Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled 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]. Key words: Computable real function of bounded variation, Absolute continuous function, Jordan decomposition, Polynomial time computable function of bounded variation.

• Type: Journal
• Year: 2002
• Where: ENTCS
• Authors: Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl
• Keywords: Bounded Variation, Computable Real Function, ENTCS 2002, Real Function