(06/12/2022, 06:50 AM)Daniel Wrote:(06/12/2022, 06:33 AM)JmsNxn Wrote:JmsNxn the technique in question works for all fixed points except super attracting.(06/12/2022, 06:17 AM)Daniel Wrote: See tetration combinatorics for more information. The example derives \( D^4f^n(z) \). The following works for all smooth iterated functions, so it applies to tetration and the hyperoperators.
Enumerate the total partition of 65536 (not computationally practical), evaluate each enumeration and add the terms together.
Hey, Daniel. Catullus was asking about Kneser. This does not solve Kneser. This only solves the geometric solution about a Fixed point (Schroder iteration).
Well aware of that Daniel. That's not Kneser. That's just Schroder iteration about a fixed point. Kneser is far more involved. You are not solving a theta mapping...

