Acyclicity conjecture for the optimal-predictor graph
Statement
For and , let be the directed graph whose vertices are all Boolean functions of variables, with a directed edge from each function to its optimal predictor whenever they differ; if is identically zero, set . A cycle-free directed graph contains no directed cycles.
Optimal-predictor acyclicity conjecture. The graph contains no cycles.
If true, this would make the number of -self-predicting functions equal to the number of connected components of , as described in the source; the supplied text does not state a resolution.
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.