2016/12/30 by Paul Potgieter, Potgieter, Paul
Computer Science · Mathematics · #42A20 #60G15 #Computability, Logic, AI Algorithms #FOS: Mathematics #Mathematical Dynamics and Fractals #Primary 68Q30 #Probability (math.PR) #Probability and Statistical Research #secondary 42A38
paper · pdf · doi:10.48550/arxiv.1612.09492
openalex publication_date 2016/12/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider some random series parametrised by complex binary strings. The simplest case is that of Rademacher series, independent of a time parameter. This is then extended to the case of Fourier series on the circle with Rademacher coefficients. Finally, a specific Fourier series which has coefficients determined by a computable function is shown to converge to an algorithmically random Brownian motion.