Daniel Wrote:See http://tetration.org/tetration_net/tetra...torics.htm and http://tetration.org/tetration_net/tetra...omplex.htm for my solutions for complex tetration. The combinatorics information can be used for solutions for complex Ackermann function.

If I understand it right you use the uniqueness of continuous iteration of formal powerseries with a fixed point. To achieve this you need a fixed point of

and call it

.

Then you continuously iterate

expanded at this fixed point and define then tetration as

.

This is an interesting approach and makes me ponder about the possible fixed points, solutions of

. Because

has its maximum at

we conclude that exactly for

(interestingly this base occurs also in Jayd's approach) there is exactly one real fixed point

of

.

Yes this is striking. Do you have also some Mathematica/Maple/etc code prepared? Is convergence guarantied? It would be quite interesting to compare it with the solutions of Andrew and Jayd.

However because there is no base transform formula for tetration, it maybe that

is the only base with a certain uniqueness.

Note also that Kneser used a similar approach to define the continuous iterates of

, he however used a complex fixed point (as we have seen for

there is no real fixed point). And the result was not real valued, so made some manipulations to make it real valued, see

[1] H. Kneser, Reelle analytische Lösungen der Gleichung

und verwandter Funktionalgleichungen, J. Reine Angew. Math. 187 (1949), 56–67 (German).

(Note: in the coming days I will make a post about continuous iteration of powerseries with fixed points.)