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?

What about computing the inverse Kneser's tetration, instead of his super logarithm?

What about computing the analytical continuation of the Kneser method?

ฅ(ﾐ⚈ ﻌ ⚈ﾐ)ฅ

Please remember to stay hydrated.

Sincerely: Catullus

Please remember to stay hydrated.

Sincerely: Catullus