Affiliation:
1. School of Mathematics and Statistics, Victoria University of Wellington, NZ
2. Centre for Quantum Technologies, National University of Singapore, Singapore
Abstract
Rademacher (Mathematische Annalen 87 (1922) 112–138), Steinhaus (Mathematische Zeitschrift 31 (1930) 408–416) and Paley and Zygmund (Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 337–257, Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 458–474, Mathematical Proceedings of the Cambridge Philosophical Society 28 (1932) 190–205) initiated the extensive study of random series. Using the theory of algorithmic randomness, which is a mix of computability theory and probability theory, we investigate the effective content of some classical theorems. We discuss how this is related to an old question of Kahane and Bollobás. We also discuss how considerations of such algorithmic questions about random series seem to lead to new notions of algorithmic randomness.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference35 articles.
1. Variations on Salem–Zygmund results for random trigonometric polynomials: Application to almost sure nodal asymptotics;Angst;Electronic J. Probability,2021
2. Coherent randomness tests and computing the K-trivial sets;Bienvenu;J. Eur. Math. Soc. (JEMS),2016
3. Small π 1 0 classes;Binns;Archive for Mathematical Logic,2005
4. The rearrangement number;Blass;Trans. Amer. Math. Soc.,2020
5. B. Bollobás, Random Graphs, 2nd edn, Cambridge Studies in Advanced Mathematics, Vol. 73, Cambridge University Press, Cambridge, 2001.