{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreieuzbxmhlmcd6iqmzhwhpwycdkynwlngqmcjxj7b7bttvq74rv6ry",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mghsts6ykio2"
  },
  "path": "/report/2026/034",
  "publishedAt": "2026-03-07T09:21:48.000Z",
  "site": "https://eccc.weizmann.ac.il",
  "textContent": "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.",
  "title": "TR26-034 |  Limit on the computational power of $\\mathrm{C}$-random strings | \n\n\tAlexey Milovanov"
}