The generalized probability coding conjecture for P^G
Statement
Let be the domain of finite binary strings under consideration, and let and denote the corresponding generalized probability and complexity functions. Write for the prefix complexity associated with . Generalized probability coding conjecture. For every with ,
This conjecture asks for the same tight coding inequality in the generalized setting, where the preceding discussion notes that 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.