Constructs a universal decompressor U such that the set of C_U-random strings does not decide the Halting Problem in polynomial time with oracle access.
Output the lexicograph- ically first stringznot present in this list
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Limit on the computational power of $\mathrm{C}$-random strings
Constructs a universal decompressor U such that the set of C_U-random strings does not decide the Halting Problem in polynomial time with oracle access.