Comment by ironborn123
1 day ago
Well lets give these models a grand challenge then.
I conjecture the true growth rate is O(n(log(n))^(1-f(n))) where f(n) is a slowly increasing function of n.
So larger the integers, more efficient the multiplication gets.
AIs of the world, make this your target, and have centuries worth of fun!!
You forgot to specify that f(n) approaches 1 so that is an easy challenge
yes f(n) tending to 1 as n tends to infinity is the worthy goal. how slowly it gets there would determine whether the growth is effectively O(n) or something slightly larger but that refinement can come later.