Local time of Martin-Lof Brownian motion

08/03/2022

∙

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.

READ FULL TEXT

Local time of Martin-Lof Brownian motion

On the close interaction between algorithmic randomness and constructive/computable measure theory

Algorithmic Randomness and Kolmogorov Complexity for Qubits

Generating Randomness from a Computable, Non-random Sequence of Qubits

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

Hölder Conditions of Local Times and Exact Moduli of non-differentiability for Spherical Gaussian fields

An Algorithmic Refinement of Maxent Induces a Thermodynamic-like Behaviour in the Reprogrammability of Generative Mechanisms

Effective Continued Fraction Dimension versus Effective Hausdorff Dimension of Reals

Local time of Martin-Lof Brownian motion

Related Research

On the close interaction between algorithmic randomness and constructive/computable measure theory

Algorithmic Randomness and Kolmogorov Complexity for Qubits

Generating Randomness from a Computable, Non-random Sequence of Qubits

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

Hölder Conditions of Local Times and Exact Moduli of non-differentiability for Spherical Gaussian fields

An Algorithmic Refinement of Maxent Induces a Thermodynamic-like Behaviour in the Reprogrammability of Generative Mechanisms

Effective Continued Fraction Dimension versus Effective Hausdorff Dimension of Reals