05/04/2009, 08:57 PM
(This post was last modified: 05/04/2009, 08:59 PM by Base-Acid Tetration.)
bo, you needed to see my explanation.
1. Evaluate g(x) at c first.
2. Hyper-n-iterate f to the OUTPUT of Step 1.
3. Evaluate the resulting function at c.
For n=1 (iteration), to evaluate this expression at any given natural x=c:
1. Evaluate g(x) at c first.
2. Iterate f to the OUTPUT of Step 1.
3. Evaluate the resulting function at c.
The set of all ordered pairs resulting from this evaluation is {(x, [f It_1 g(x)] (x))}.
1. Evaluate g(x) at c first.
2. Hyper-n-iterate f to the OUTPUT of Step 1.
3. Evaluate the resulting function at c.
For n=1 (iteration), to evaluate this expression at any given natural x=c:
1. Evaluate g(x) at c first.
2. Iterate f to the OUTPUT of Step 1.
3. Evaluate the resulting function at c.
The set of all ordered pairs resulting from this evaluation is {(x, [f It_1 g(x)] (x))}.
