


























In this paper we study the local times of Brownian motion from the point of view of algorithmic randomness. We introduce the notion of effective local time and show that any path which is Martin-Löf random with respect to the Wiener measure has continuous effective local times at every computable point. Finally we obtain a new simple representation of classical Brownian local times, computationally expressed.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。