In 1987 Stephen Wolfram introduced me to the question of whether all maps are flows. Given the fifteen-year-old mathematics on Tetration.org, I have a simple proof that all maps are flows, that they are two different views of the same thing. Consider the Taylor series of an arbitrary smooth iterated function and it's representation as the combinatorial structure total partitions, the recursive version of set partitions. Each enumerated combinatorial structure has a symmetry associated with it. Let's say we want to consider , just remove all combinatorial structures inconsistent with . Because I can define as the domain and the iterant, through representation theory, that if I can compute with matrices, I can compute within any symmetry.

Just as the exponential function of invertible matrices can be computed, all hyperoperations can be defined with invertible matrices.

Daniel

Just as the exponential function of invertible matrices can be computed, all hyperoperations can be defined with invertible matrices.

Daniel