显而易见
发表于 2025-4-1 05:46:42
http://reply.papertrans.cn/63/6262/626136/626136_61.png
吹牛需要艺术
发表于 2025-4-1 09:29:33
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 .(.).