Meng–Lin–Yang's optimal-query conjecture for the Rényi-Ulam game
Statement
Let and satisfy and . Define
Set
Meng–Lin–Yang's conjecture. With these definitions,
This conjecture concerns the optimal query in the Rényi-Ulam game with restricted-size queries, where denotes the relevant one-lie query complexity and the parameters describe the current state. The paper presents it as a conjecture about optimal play; no resolution is given in the supplied text.
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.