Conjecture on collapse and average logarithmic integer complexity
Statement
Let denote the average logarithmic integer complexity, and let be the corresponding limiting average complexity. Say that a number collapses when powers of have unexpectedly low integer complexity. The conjecture is stated in the context of treating as random.
Collapse conjecture. If
then is unlikely to collapse.
This claim appears inside an ignored passage and is presented heuristically rather than as a proved theorem. The source supplies no resolution, so it remains open.
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.