Titlebook: Mathematical Foundations of Computer Science 2002; 27th International S Krzysztof Diks,Wojciech Rytter Conference proceedings 2002 Springer

顯而易見

吹牛需要藝術(shù)

Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits, our main result asserts that for any computable function . that goes non-ascendingly to zero, any rec-random set is i.o. truth-table-autoreducible such that the set of guessed bits has density bounded from below by .(.).