It took some thinking but I recovered a closed form expression for hyper operators at prime numbers. The result is interesting to say the least. It is not analytic; and in fact the iteration may not even be continuous but discrete. We start by considering a function 
 = \sum_i \mu_{x;i} \cdot \rho_i)
 = \rho)
 = 0)
 = \psi(x) + \psi(y))
 = y \psi(x))
But the fundamental theorem of arithmetic applies for
as well.
 = \prod_i \rho_i^{\kappa_{x;i}})
Iterating we get a formula:
 = \sum_i \mu_{\psi^{\circ s-1}(x);i} \rho_i)
This allows us to develop an expression for integer arguments of
. We will now make some claims about the structure of iterating .
Claim I:
is one to one for all complex iterates that exist and satisfy | < 1)
. This qualifies as the reason operators in between  \in (1,2])
are not commutative. The reason isn't one to one is because it turns  = \rho_j \cdot \rho_i = \psi(\rho_j^{\rho_i}))
. However; since  \in (0,1])
we have  = \rho_i \,\,\Delta_{2-s}\,\,\rho_j \neq \psi^{\circ s}(\rho_j^{\rho_i}))
because 
is not commutative.
Claim II:
's range is closed under multiplication
Claim III:
 = \prod_i \rho_i^{\eta_{x;i}})
for some sequence 
. This claim implies II with some algebra, but as well determines some more powerful results. This factorization into primes with algebraic exponents is unique by Baker's theorem. This would be the main restriction determining for what values of we can iterate .
With these we define hyper operators by the following formula.
\psi^{\circ s-1}(y)) & \sigma \in (0,1]\\<br />
\psi^{\circ 1-s}(\psi^{\circ s-1}(x) y) & \sigma \in [1,2]\\<br />
\end{array}<br />
)
And we extend the operators recursively to the negative domain by the following law,
and  < 1)
 = \psi^{\circ q}(x) \Delta_{s-q} \psi^{\circ q}(y))
These operators form the tremendous result, for
of 
forming a commutative semi-ring! But on top of that: Recursion is satisfied for all prime numbers.
The question is, of course, how do we define iteration on. And on top of that, where and when is an iterate defined?
These operators have some really interesting results involving unique factorization. Although, all these further results rely on iterating with the restriction of claims I-III. So I'm wondering if anyone knows of any techniques that would be required? I'm thinking the iteration would require not a continuous expression but a discrete expression involving the unique coefficients of )
.
This can work in fact for every natural number given a few tweaks that I'll explain later.
But the fundamental theorem of arithmetic applies for
Iterating we get a formula:
This allows us to develop an expression for integer arguments of
Claim I:
Claim II:
Claim III:
With these we define hyper operators by the following formula.
And we extend the operators recursively to the negative domain by the following law,
These operators form the tremendous result, for
The question is, of course, how do we define iteration on
These operators have some really interesting results involving unique factorization. Although, all these further results rely on iterating
This can work in fact for every natural number given a few tweaks that I'll explain later.
