Randomness extraction in computability theory

Article type: Research Article

Authors: Cenzer, Douglas^{a; *} | Porter, Christopher P.^b

Affiliations: [a] Department of Mathematics, University of Florida, FL, USA | [b] Department of Mathematics and Computer Science, Drake University, IA, USA

Correspondence: [*] Corresponding author. [email protected].

Abstract: In this article, we study a notion of the extraction rate of Turing functionals that translate between notions of randomness with respect to different underlying probability measures. We analyze several classes of extraction procedures: (1) a class that generalizes von Neumann’s trick for extracting unbiased randomness from the tosses of a biased coin, (2) a class based on work of by Knuth and Yao (which more properly can be characterized as extracting biased randomness from unbiased randomness), and (3) a class independently developed by Levin and Kautz that generalizes the data compression technique of arithmetic coding. For the first two classes of extraction procedures, we identify a level of algorithmic randomness for an input that guarantees that we attain the extraction rate along that input, while for the third class, we calculate the rate attained along sufficiently random input sequences.

Keywords: Computability theory, algorithmic randomness, randomness extraction

DOI: 10.3233/COM-210343

Journal: Computability, vol. 12, no. 1, pp. 1-21, 2023