算法随机性与逼近元（英文）

Algorithmic Randomness and Approximate Identities

本论文将会提出逼近元微分定理的能行化版本。我们证明了在实数集上,点x对所有L1可计算函数满足逼近元微分定理描绘的收敛,当且仅当x是Schnorr随机的。

In this paper, we will provide an effective version of Differentiation Theorem for Approximate Identities. We prove that a point x∈ R is Schnorr random, if and only if Differentiation Theorem for Approximate Identities holds at x for all L1-computable function f ∈ L1（R）.