ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B♯B^{\sharp} be the domain of finite binary strings under consideration, and let PG(x)P^G(x) and KG(x)K^G(x) denote the corresponding generalized probability and complexity functions. Write KPG(x)KP^G(x) for the prefix complexity associated with PGP^G. Generalized probability coding conjecture. For every x∈B♯x\in B^{\sharp} with PG(x)>0P^G(x)>0,

KG(x)≤KPG(x)+O(1).K^G(x)\leq KP^G(x)+O(1).

This conjecture asks for the same tight coding inequality in the generalized setting, where the preceding discussion notes that PGP^G is a semimeasure rather than a measure. Its status is unresolved in the supplied source.

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.