The fast self-correcting algorithm conjecture for computing π
Statement
Let denote the time complexity of multiplying two -bit integers. The self-correcting algorithm described in the paper computes with error .
Fast self-correcting algorithm conjecture. Algorithm~ runs in bit operations.
The algorithm is already proved to run in bit operations and is self-correcting, producing a more accurate approximation from an approximate input with cubic convergence. The conjecture asserts the sharper complexity matching the known asymptotically fastest algorithms for computing ; no resolution is supplied in the 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.