On the computational power of $C$-random strings

Denote by $H$ the Halting problem. Let $R_{U} : = {x ∣ C_{U} (x) \geq ∣ x ∣}$ , where $C_{U} (x)$ is the plain Kolmogorov complexity of $x$ under a universal decompressor $U$ . We prove that there exists a universal $U$ such that $H \in P^{R_{U}}$ , solving the problem posted by Eric Allender.

On the computational power of $C$ -random strings

文献摘要

讨论

讲解博客

AI智能校验

On the computational power of $C$ -random strings

文献摘要

讨论

讲解博客

AI智能校验

On the computational power of CC-random strings

文献摘要

讨论

|讲解博客

|AI智能校验

On the computational power of CC-random strings

文献摘要

讨论

|讲解博客

|AI智能校验

On the computational power of $C$ -random strings

讲解博客

AI智能校验

On the computational power of $C$ -random strings

讲解博客

AI智能校验