ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ff be the 11-periodic continuous function

f(θ)=Φ(θ)+log⁡r(θ).f(\theta)=\Phi(\theta)+\log r(\theta).

A computable modulus of continuity for ff is a computable function μ:N→N\mu:\mathbb{N}\to\mathbb{N} such that

∣f(θ1)−f(θ2)∣<2−nwhenever∣θ1−θ2∣<2−μ(n).|f(\theta_1)-f(\theta_2)|<2^{-n}\quad\text{whenever}\quad |\theta_1-\theta_2|<2^{-\mu(n)}.

Computable-modulus conjecture. The function ff has a computable modulus of continuity.

This conjecture would provide the quantitative continuity needed to show that the explicitly constructed parameter θ\theta, whose Julia set is non-computable, is nevertheless computable in polynomial time. No restriction is imposed on the growth rate of μ\mu beyond computability; the source gives no resolution of the conjecture.

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.