doi:10.1016/j.ic.2021.104746engLutz, Jack HMayordomo, ElviraComputing absolutely normal numbers in nearly linear timeART-2021-124622A real number x is absolutely normal if, for every base b ≥ 2, every two equally long strings of digits appear with equal asymptotic frequency in the base-b expansion of x. This paper presents an explicit algorithm that generates the binary expansion of an absolutely normal number x, with the nth bit of x appearing after npolylog(n) computation steps. This speed is achieved by simultaneously computing and diagonalizing against a martingale that incorporates Lempel-Ziv parsing algorithms in all bases.2021http://zaguan.unizar.es/record/11208310.1016/j.ic.2021.104746http://zaguan.unizar.es/record/112083oai:zaguan.unizar.es:112083info:eu-repo/grantAgreement/ES/MEC/PID2019-104358RB-I00info:eu-repo/grantAgreement/ES/MEC/TIN2011-27479-C04-01info:eu-repo/grantAgreement/ES/MEC/TIN2016-80347-RINFORMATION AND COMPUTATION 281 (2021), 104746 [12 pp.]by-nc-ndhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccess