ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX and YY be infinite binary sequences, and let an oracle computation of XX by YY have an oracle-use function measuring how many bits of YY are queried to compute the first nn bits of XX. Write X↾nX\upharpoonright_n for the length-nn prefix of XX, and let K(X↾n)K(X\upharpoonright_n) denote its prefix-free Kolmogorov complexity. Oracle-use conjecture. There exists XX such that, for every YY computing XX, the oracle-use in the computation is not bounded above by the function n↦K(X↾n)n\mapsto K(X\upharpoonright_n). This asserts that the stronger bound suggested by the general upper bound K(X↾n)+log⁡nK(X\upharpoonright_n)+\log n is not achievable for every sequence. Bounds of this form are connected with online coding methods and the complexity of initial segments; the cited special case of left-c.e. reals shows that a related bound can be achieved in some cases, while the general impossibility claim is presented here as a conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.