Lowness for genericity
Starting from the Nitzpon's definition of lowness for 1-genericity, the author shows that there is no Turing degree which is low for 1-genericity. He also proves partially Nitzpron's conjecture: the hyperimmune-free degrees are the same as the degrees low for weak 1-genericity. So, with Miller, the author proves that every computable traceable degree is low for weak 1-genericity.
scientific article; zbMATH DE number 5013640