Nullifying randomness and genericity using symmetric difference

Barmpalias, 2011, Kolmogorov complexity of initial segments of sequences and arithmetical definability, Theoret. Comput. Sci., 412, 5656, 10.1016/j.tcs.2011.06.006 Bienvenu, 2012, A constructive version of Birkhoff's ergodic theorem for Martin–Löf random points, Inform. and Comput., 210, 21, 10.1016/j.ic.2011.10.006 Jockusch, 1984, Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers, J. Symbolic Logic, 49, 1205, 10.2307/2274273 Kihara Kjos-Hanssen, 2012, Lowness notions, measure and domination, J. Lond. Math. Soc. (2), 85, 869, 10.1112/jlms/jdr072 Knopp, 1990 Miyabe, 2011, Truth-table Schnorr randomness and truth-table reducible randomness, Math. Log. Q., 57, 323, 10.1002/malq.200910128 Miyabe, 2013, Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness, 251 Nies, 2005, Lowness properties and randomness, Adv. Math., 197, 274, 10.1016/j.aim.2004.10.006 Nies, 2008 Yu, 2006, Lowness for genericity, Arch. Math. Logic, 45, 233, 10.1007/s00153-005-0306-y