an:07036444 Zbl 1445.03049 Bienvenu, Laurent; Porter, Christopher P. On the interplay between effective notions of randomness and genericity EN J. Symb. Log. 84, No. 1, 393-407 (2019). 00429718 2019
j
03D32 03D28 algorithmic randomness; effective genericity In the last few decades, the field of algorithmic randomness has developed out of the much older field of computability theory. The primary reason for this new field to develop was interest in the question of what makes objects special (or not) within a large set of objects. The simplest setting in which to study this question, and the setting that was studied most intensely, is that of Cantor space. Here, the core question becomes the question of which infinite binary sequences are typical'' and which ones are unusual'' in some way. There are two important ways of formalising this idea of typicality'', essentially corresponding to the two field of measure theory and Baire category theory from classical noneffective mathematics, but incorporating effectivity considerations using the tools of computability theory. The two resulting ideas are effective randomness and effective genericity. A large body of results has been obtained in both areas, and is now the subject of several textbooks. Naturally, the relationship between both possible formalisations has been studied as well, in analogy to how the relation between measure theory and Baire category theory has been studied in noneffective mathematics. In particular, it has been shown that randomness and genericity are orthogonal to each other in the sense that random sequences are not generic and vice versa. But, taking advantage of the tools provided by computability theory, we can even formulate a much stronger version of this orthogonality: Sufficiently random sequences do not even \textit{compute} sufficently generic sequences, and vice versa. Before the present article, the strongest known form of this observation was that every $2$-random sequence forms a minimal pair in the Turing degrees with every $2$-generic sequence, as proven by \textit{A. Nies} et al. [J. Symb. Log. 70, No. 2, 515--535 (2005; Zbl 1090.03013)]. However, for insufficient levels of randomness or genericity, this stronger form of the orthogonality does \textit{not} hold: First, \textit{S. Kurtz} [Randomness and genericity in the degrees of unsolvability. Champaign, IL: University of Illinois at Urbana (PhD Thesis) (1981)] and \textit{S. M. Kautz} [Degrees of random sequences. Ithaca, NY: Cornell University (PhD Thesis) (1991)] proved that every $2$-random sequence computes a $1$-generic sequence. And secondly, by a trivial consequence of the Ku??era-G??cs theorem [\textit{A. Ku??era}, Lect. Notes Math. 1141, 245--259 (1985; Zbl 0622.03031); \textit{P. G??cs}, Inf. Control 70, 186--192 (1986; Zbl 0628.03024)], for arbitrarily large $n$, every $n$-generic sequence is computed by some $1$-random sequence. It is therefore natural to wonder at which randomness level (between $1$- and $2$-randomness) and genericity level (between $1$- and $2$-genericity) exactly the limit between the weaker and the stronger kind of orthogonality is situated. In the present article, the authors give a precise answer to this question, at least for the notions of randomness and genericity usually studied in the literature. First, they give an answer to a question of \textit{G. Barmpalias} et al. [Proc. Lond. Math. Soc. (3) 109, No. 1, 1--39 (2014; Zbl 1332.03009)] by proving that every Demuth random sequence computes a $1$-generic. Demuth randomness is a weaker randomness notion than $2$-randomness, so that this is a strengthening of the result by Kurtz [loc. cit.] and Kautz [loc. cit.], above. As Kurtz' and Kautz' proof is hard to analyse with the necessary precision with regards to the level of randomness needed for it to work, they instead use the framework of fireworks arguments introduced by \textit{A. Rumyantsev} and \textit{A. Shen} [Fundam. Inform. 132, No. 1, 1--14 (2014; Zbl 1317.68131)] to show that the set of $X$'s that fail to compute a $1$-generic can be covered by a new type of test. They then show that this new type of test characterizes Demuth randomness. The new test notion is a variant of a test notion proposed by \textit{J. N. Y. Franklin} and \textit{K. M. Ng} [J. Symb. Log. 79, No. 3, 776--791 (2014; Zbl 1353.03046)] to characterise the strictly weaker notion of weak Demuth randomness. The characterisation of the sequences passing this new test type can also be applied in other contexts involving fireworks arguments. Namely, if an element of a set $S$ can be obtained with positive probability using fireworks arguments, then every Demuth random computes such an element. In conjunction with a result of \textit{L. Bienvenu} and \textit{L. Patey} [Inf. Comput. 253, Part 1, 64--77 (2017; Zbl 1423.03141)] this implies that every Demuth random computes a diagonally noncomputable function which computes no $1$-random. Next, the authors study whether the level of genericity can be increased in their theorem, that is, whether a Demuth random can compute a sequence that has a higher level of genericity than $1$-genericity. They give a negative answer for the known genericity notions, by proving that every Demuth random sequence forms a minimal pair with every pb-generic sequence. Here, pb-genericity is a relatively weak genericity notion between $1$- and $2$-genericity which in particular is implied by weak $2$-genericity. The author's result strengthens a previously known corollary of two results by \textit{S. B. Cooper} (ed.) et al. [Computability, enumerability, unsolvability. Directions in recursion theory. Cambridge: Cambridge University Press (1996; Zbl 0830.00006)] and \textit{R. Downey} and \textit{K. M. Ng} [Lect. Notes Comput. Sci. 5635, 154--166 (2009; Zbl 1268.03053)], as well as the previously mentioned result of \textit{A. Nies} et al. [J. Symb. Log. 70, No. 2, 515--535 (2005; Zbl 1090.03013)]. Finally, the authors study the situation for weak $2$-randomness, a notion that is incomparable with Demuth randomness. They show that for every comeager subset of Cantor space there is a weakly $2$-random sequence computing an element of it. In particular, for any level of genericity, there is a sequence $X$ of that genericity level and some weakly $2$-random sequence that computes $X$. The proof is a modification of a result of \textit{G. Barmpalias} et al. [J. Symb. Log. 76, No. 2, 491--518 (2011; Zbl 1248.03065)]. It involves a variant of Ku??era-G??cs coding which, unlike in the original proof of the Ku??era-G??cs theorem [\textit{A. Ku??era}, Lect. Notes Math. 1141, 245--259 (1985; Zbl 0622.03031); \textit{P. G??cs}, Inf. Control 70, 186--192 (1986; Zbl 0628.03024)] for $1$-random sequences, must be allowed to make errors. Rupert H??lzl (Neubiberg) Zbl 1090.03013; Zbl 0622.03031; Zbl 0628.03024; Zbl 1332.03009; Zbl 1317.68131; Zbl 1353.03046; Zbl 1423.03141; Zbl 0830.00006; Zbl 1268.03053; Zbl 1248.03065