We construct a universal decompressor $U$ for plain Kolmogorov complexity $\mathrm{C}_U$ such that the Halting Problem cannot be decided by any polynomial-time oracle machine with access to the set of random strings $R_{\mathrm{C}_U} = \{x : \mathrm{C}_U(x) \ge |x|\}$. This result resolves a problem posed by Eric Allender regarding the computational power of Kolmogorov complexity-based oracles.

翻译：我们构建了一个针对原始Kolmogorov复杂度$\mathrm{C}_U$的通用解压缩器$U$，使得任何具有随机字符串集合$R_{\mathrm{C}_U} = \{x : \mathrm{C}_U(x) \ge |x|\}$访问权限的多项式时间谕示机都无法判定停机问题。该结果解决了Eric Allender提出的关于基于Kolmogorov复杂度的谕示计算能力的一个问题。