3 problems

Balancing-algorithm conjecture. Algorithm always converges. Moreover, the number of iterations required to reach a given tolerance is $O(\log(n))$ for fixed $\epsilon$, and…

Fast self-correcting $pi$ algorithm conjecture. Algorithm runs in $O(M(n)\log n)$ bit operations.

For $n$ a positive integer, let the alternating normalization procedure be the row and column normalization algorithm in Algorithm, initialized by a random complex Gaussian tensor…