Tetration Forum

Full Version: Computing Kneser's Super Logarithm, and its Analytic Continuation
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
What is the big O for computing Kneser's super logarithm, with the fastest known algorithm for computing it? Do we know what the best possible big O for computing Kneser's super logarithm is, like maybe a Galactic algorithm for computing it? (Even if we do not know what algorithm would have that big O.) If so, what is it?
What about computing the inverse Kneser's tetration, instead of his super logarithm?
What about computing the analytical continuation of the Kneser method?
the analytic continuation is usually done by using the functional equations.

assuming analytic and the validity of the functional equation ofcourse.
What about for computing the Tetra-Euler number, or for calculating the Tetra-critical base?