{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:52:52Z","timestamp":1777517572964,"version":"3.51.4"},"reference-count":35,"publisher":"SAGE Publications","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["COM"],"published-print":{"date-parts":[[2023,9,13]]},"abstract":"<jats:p>Rademacher (Mathematische Annalen 87 (1922) 112\u2013138), Steinhaus (Mathematische Zeitschrift 31 (1930) 408\u2013416) and Paley and Zygmund (Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 337\u2013257, Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 458\u2013474, Mathematical Proceedings of the Cambridge Philosophical Society 28 (1932) 190\u2013205) 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\u00e1s. We also discuss how considerations of such algorithmic questions about random series seem to lead to new notions of algorithmic randomness.<\/jats:p>","DOI":"10.3233\/com-220433","type":"journal-article","created":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:12:48Z","timestamp":1694776368000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmically random series"],"prefix":"10.1177","author":[{"given":"Rodney G.","family":"Downey","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Victoria University of Wellington, NZ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noam","family":"Greenberg","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Victoria University of Wellington, NZ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Tanggara","sequence":"additional","affiliation":[{"name":"Centre for Quantum Technologies, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/COM-220433_ref1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/21-EJP716","article-title":"Variations on Salem\u2013Zygmund results for random trigonometric polynomials: Application to almost sure nodal asymptotics","volume":"26","author":"Angst","year":"2021","journal-title":"Electronic J. Probability"},{"issue":"4","key":"10.3233\/COM-220433_ref2","doi-asserted-by":"publisher","first-page":"773","DOI":"10.4171\/JEMS\/602","article-title":"Coherent randomness tests and computing the K-trivial sets","volume":"18","author":"Bienvenu","year":"2016","journal-title":"J. Eur. Math. Soc. (JEMS)"},{"issue":"4","key":"10.3233\/COM-220433_ref3","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00153-005-0319-6","article-title":"Small \u03c0 1 0 classes","volume":"45","author":"Binns","year":"2005","journal-title":"Archive for Mathematical Logic"},{"issue":"1","key":"10.3233\/COM-220433_ref4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1090\/tran\/7881","article-title":"The rearrangement number","volume":"373","author":"Blass","year":"2020","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.3233\/COM-220433_ref5","unstructured":"B.\u00a0Bollob\u00e1s, Random Graphs, 2nd edn, Cambridge Studies in Advanced Mathematics, Vol.\u00a073, Cambridge University Press, Cambridge, 2001."},{"issue":"1","key":"10.3233\/COM-220433_ref7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.2178\/jsl\/1294170993","article-title":"Weihrauch degrees, omniscience principles and weak computability","volume":"76","author":"Brattka","year":"2011","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.3233\/COM-220433_ref8","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1090\/tran\/6484","article-title":"Randomness and differentiability","volume":"368","author":"Brattka","year":"2016","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.3233\/COM-220433_ref9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1214\/009117905000000459","article-title":"On random almost periodic trigonometric polynomials and applications to ergodic theory","volume":"34","author":"Cohen","year":"2006","journal-title":"Annals of Probability"},{"key":"10.3233\/COM-220433_ref10","doi-asserted-by":"crossref","unstructured":"R.\u00a0Downey and D.\u00a0Hirschfeldt, Algorithmic Randomness and Complexity, Springer, 2010.","DOI":"10.1007\/978-0-387-68441-3"},{"issue":"5","key":"10.3233\/COM-220433_ref11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/3319408","article-title":"Algorithmic randomness","volume":"62","author":"Downey","year":"2019","journal-title":"Communications of the ACM"},{"issue":"07","key":"10.3233\/COM-220433_ref12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/noti1905","article-title":"Computability and randomness","volume":"66","author":"Downey","year":"2019","journal-title":"Notices of the American Mathematical Society"},{"key":"10.3233\/COM-220433_ref13","doi-asserted-by":"publisher","first-page":"411","DOI":"10.2178\/bsl\/1154698741","article-title":"Calibrating randomness","volume":"12","author":"Downey","year":"2006","journal-title":"Bulletin of Symbolic Logic"},{"issue":"1","key":"10.3233\/COM-220433_ref14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/17M1161853","article-title":"Smooth random functions, random codes, and Gaussian processes","volume":"61","author":"Filip","year":"2019","journal-title":"SIAM Review"},{"issue":"3","key":"10.3233\/COM-220433_ref15","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00224-010-9263-x","article-title":"Randomness on computable probability spaces\u00a0\u2013 a dynamical point of view","volume":"48","author":"G\u00e1cs","year":"2011","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10.3233\/COM-220433_ref16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1215\/00294527-2009-018","article-title":"How incomputable is the separable Hahn\u2013Banach theorem?","volume":"50","author":"Gherardi","year":"2010","journal-title":"Notre Dame J. Form. Log."},{"issue":"3\u20134","key":"10.3233\/COM-220433_ref17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.3233\/COM-180219","article-title":"Cardinal invariants, non-lowness classes, and Weihrauch reducibility","volume":"8","author":"Greenberg","year":"2019","journal-title":"Computability"},{"key":"10.3233\/COM-220433_ref19","unstructured":"J.-P.\u00a0Kahane, Some Random Series of Functions, Cambridge University Press, 2003."},{"key":"10.3233\/COM-220433_ref21","unstructured":"M.\u00a0Li and P.\u00a0Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications, Springer International Publishing, 2019."},{"issue":"6","key":"10.3233\/COM-220433_ref22","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Information and Control"},{"key":"10.3233\/COM-220433_ref23","doi-asserted-by":"crossref","unstructured":"A.\u00a0Nies, Computability and Randomness, Oxford University Press, 2012.","DOI":"10.1142\/9789814324359_0039"},{"issue":"1","key":"10.3233\/COM-220433_ref24","doi-asserted-by":"crossref","DOI":"10.1016\/j.apal.2020.102872","article-title":"Computable analogs of cardinal characteristics: Prediction and rearrangement","volume":"172","author":"Ongay-Valverde","year":"2021","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"10.3233\/COM-220433_ref25","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1017\/S0305004100016078","article-title":"On some series of functions, (1)","volume":"26","author":"Paley","year":"1930","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"4","key":"10.3233\/COM-220433_ref26","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1017\/S0305004100016212","article-title":"On some series of functions, (2)","volume":"26","author":"Paley","year":"1930","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"2","key":"10.3233\/COM-220433_ref27","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1017\/S0305004100010860","article-title":"On some series of functions, (3)","volume":"28","author":"Paley","year":"1932","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"11","key":"10.3233\/COM-220433_ref28","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1016\/j.apal.2018.07.001","article-title":"Algorithmically random series and Brownian motion","volume":"169","author":"Potgieter","year":"2018","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.3233\/COM-220433_ref29","doi-asserted-by":"crossref","unstructured":"M.B.\u00a0Pour-El and J.I.\u00a0Richards, Computability in Analysis and Physics, Cambridge University Press, 2017.","DOI":"10.1017\/9781316717325"},{"key":"10.3233\/COM-220433_ref30","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BF01458040","article-title":"Einige s\u00e4tze \u00fcber reihen von allgemeinen orthogonalfunktionen","volume":"87","author":"Rademacher","year":"1922","journal-title":"Mathematische Annalen"},{"key":"10.3233\/COM-220433_ref31","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF02393433","article-title":"Some properties of trigonometric series whose terms have random signs","volume":"91","author":"Salem","year":"1954","journal-title":"Acta. Math."},{"issue":"1","key":"10.3233\/COM-220433_ref32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2178\/bsl\/1107959497","article-title":"Mass problems and randomness","volume":"11","author":"Simpson","year":"2005","journal-title":"Bull. Symbolic Logic"},{"key":"10.3233\/COM-220433_ref33","doi-asserted-by":"crossref","unstructured":"R.I.\u00a0Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"10.3233\/COM-220433_ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629167.015"},{"issue":"1","key":"10.3233\/COM-220433_ref35","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/BF01246422","article-title":"Uber die wahrscheinlichkeit dafur, das der konvergenzkreis einer potenzreihe ihre naturliche grenze ist","volume":"31","author":"Steinhaus","year":"1930","journal-title":"Mathematische Zeitschrift"},{"key":"10.3233\/COM-220433_ref36","first-page":"230","article-title":"On computable numbers with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. Lond. Math. Soc. (2)"},{"key":"10.3233\/COM-220433_ref38","doi-asserted-by":"crossref","unstructured":"K.\u00a0Weihrauch, Computable Analysis: An Introduction, Texts in Theoretical Computer Science. An EATCS Series, Springer-Verlag, Berlin, 2000.","DOI":"10.1007\/978-3-642-56999-9"},{"key":"10.3233\/COM-220433_ref39","unstructured":"A.\u00a0Zygmund, Trigonometric Series, Vol.\u00a01, Cambridge University Press, 1959."}],"container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-220433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:03:01Z","timestamp":1777392181000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-220433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,13]]},"references-count":35,"URL":"https:\/\/doi.org\/10.3233\/com-220433","relation":{},"ISSN":["2211-3576","2211-3568"],"issn-type":[{"value":"2211-3576","type":"electronic"},{"value":"2211-3568","type":"print"}],"subject":[],"published":{"date-parts":[[2023,9,13]]}}}