A computational aspect of the Lebesgue differentiation theorem
暂无分享,去创建一个
Given an L1 -computable function, f , we identify a canonical represen- tative of the equivalence class of f , where f and g are equivalent if and only if R jf gj is zero. Using this representative, we prove a modified version of the Lebesgue Differentiation Theorem. Our theorem is stated in terms of Martin-L¨ random points in Euclidean space. 2000 Mathematics Subject Classification 03D80 (primary); 26A24 (secondary)
[1] Stephen G. Simpson,et al. Vitali's Theorem and WWKL , 2002, Arch. Math. Log..
[2] T. Broadbent. Measure and Integral , 1957, Nature.
[3] Marian Boykan Pour-El,et al. Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.
[4] Stephen G. Simpson,et al. Almost everywhere domination and superhighness , 2007, Math. Log. Q..
[5] Per Martin-Löf,et al. The Definition of Random Sequences , 1966, Inf. Control..