Algorithmically random series and Brownian motion

DOI10.1016/j.apal.2018.07.001zbMath1453.03043arXiv1612.09492OpenAlexW2827148568WikidataQ129577604 ScholiaQ129577604MaRDI QIDQ1791052

Paul Potgieter

Publication date: 4 October 2018

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.09492

zbMATH Keywords

Brownian motionFourier seriesRademacher seriesMartin-Löf randomness

Mathematics Subject Classification ID

Brownian motion (60J65) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Convergence and absolute convergence of Fourier and trigonometric series (42A20) Algorithmic randomness and dimension (03D32)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Use of the Kolmogorov complexity in analyzing control system dynamics
• The descriptive complexity of Brownian motion
• The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
• On Kurtz randomness
• A computable version of the random signs problem and Kolmogorov complexity
• Notions of weak genericity
• Arithmetical representations of Brownian motion I
• The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
• The definition of random sequences