Well this theory is structured as a plausible solution to complex hyper operators. This is a proof sketch and it requires a bit more work here and there; requires an evaluation of a limit; but there is an over all sense of plausibility.

We start by defining a sequence of analytic functions that obey the following rules:

and

Necessarily; these functions can be arbitrary and they pose the true uniqueness criterion. Nonetheless we suggest these functions and give a plausible solution.

Reason for this is it has fast convergence and satisfies the required conditions.

Now we perform a trick. Considering hyper operators; which are written by the following:

and the identity of for any natural is .

We get the usual sequence where zero is addition, one is multiplication, two is exponentiation, etc... We then write that complex operators are products of natural operators with complex exponents. Here; is as before.

It's easy to identify that at natural arguments the product converges to the natural hyperoperator it indexes.

This product; however; converges if and only if the series:

converges.

With this; we perform the ratio test.

It is clear that

Without proof; we can safely assume when x and y aren't 2 or one of them 1:

The question is if they cancel each other out. Or if one takes over the other. I'm hoping it's zero and the result is entire--the disappears in ; so the equation either diverges for all or converges for all or inconclusive. I do not believe that grows too too fast as n varies. So maybe will induce convergence. If it doesn't; we'll use a function for that decreases to zero faster than the definition as it is now. Essentially, the true difficulty is finding a solution for that allows for the convergence of .

The recursive pattern becomes much simpler to find a solution for because we only have to account for instances where . Where of course we must have . However. Most of the returned values will not be natural and for these most of our hyper operators are undefined. So the question becomes much simpler. It's almost as if we can extend the hyper operators beyond natural numbers. If you cannot get what I mean; consider:

however:

This allows us to extend operators to some real or complex numbers. Most definitely probably not all.

A brief note about the operators. They are definitely not commutative for almost all values. I haven't proved this yet however; so in the fractal chaos there may emerge a commutative operator. They are not associative for almost all values. Again; haven't proved this yet; but I think this one is pretty obvious. There may or may not exist identities for the operators. This one may be difficult to prove.

I'm mostly working on trying to prove convergence at the moment. One step at a time. Once that is proven we'll have an entire function that passes through every hyper operator at every two natural arguments. Then we tweak to be recursive. Maybe; if possible; tweak it to have a right hand identity.

We start by defining a sequence of analytic functions that obey the following rules:

and

Necessarily; these functions can be arbitrary and they pose the true uniqueness criterion. Nonetheless we suggest these functions and give a plausible solution.

Reason for this is it has fast convergence and satisfies the required conditions.

Now we perform a trick. Considering hyper operators; which are written by the following:

and the identity of for any natural is .

We get the usual sequence where zero is addition, one is multiplication, two is exponentiation, etc... We then write that complex operators are products of natural operators with complex exponents. Here; is as before.

It's easy to identify that at natural arguments the product converges to the natural hyperoperator it indexes.

This product; however; converges if and only if the series:

converges.

With this; we perform the ratio test.

It is clear that

Without proof; we can safely assume when x and y aren't 2 or one of them 1:

The question is if they cancel each other out. Or if one takes over the other. I'm hoping it's zero and the result is entire--the disappears in ; so the equation either diverges for all or converges for all or inconclusive. I do not believe that grows too too fast as n varies. So maybe will induce convergence. If it doesn't; we'll use a function for that decreases to zero faster than the definition as it is now. Essentially, the true difficulty is finding a solution for that allows for the convergence of .

The recursive pattern becomes much simpler to find a solution for because we only have to account for instances where . Where of course we must have . However. Most of the returned values will not be natural and for these most of our hyper operators are undefined. So the question becomes much simpler. It's almost as if we can extend the hyper operators beyond natural numbers. If you cannot get what I mean; consider:

however:

This allows us to extend operators to some real or complex numbers. Most definitely probably not all.

A brief note about the operators. They are definitely not commutative for almost all values. I haven't proved this yet however; so in the fractal chaos there may emerge a commutative operator. They are not associative for almost all values. Again; haven't proved this yet; but I think this one is pretty obvious. There may or may not exist identities for the operators. This one may be difficult to prove.

I'm mostly working on trying to prove convergence at the moment. One step at a time. Once that is proven we'll have an entire function that passes through every hyper operator at every two natural arguments. Then we tweak to be recursive. Maybe; if possible; tweak it to have a right hand identity.