Effective Jordan decomposition
type: Item
instance of: scholarly article
title: Effective Jordan decomposition
zbMATH Open document ID: 1071.03028
author: Robert Rettinger
author: Xizhong Zheng
published in: Theory of Computing Systems
publication date: 2005-04-19T00:00:00Z
review text: The authors examine the effective content of the Jordan decomposition theorem which states that every function of bounded variation can be expressed as the difference of two increasing functions. They give necessary and sufficent conditions for when this result is true for computable functions, and establish a number of related results, such as using a priority argument to construct an effectively absolutely continuous function that is not effectively decomposable.
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03F60
Mathematics Subject Classification ID: 26A45
Mathematics Subject Classification ID: 26A46
zbMATH DE Number: 2159487
zbMATH Keywords: effective content of Jordan decomposition theorem
zbMATH Keywords: computable functions
zbMATH Keywords: effectively absolutely continuous function
reviewed by: Rodney G. Downey
MaRDI profile type: Publication
full work available at URL: s00224-004-1193-z
OpenAlex ID: W2066786168
DOI: 10.1007/S00224-004-1193-Z
description: scientific article; zbMATH DE number 2159487