Problem 6
The function satisfies for all non-negative integers . Determine .
Step 4 of 7: Solve the level
In plain words
Each level of the recursion is one operation 'up' from the last: addition becomes doubling, and doubling will become towering.
Detailed analysis
By rule (2) and Step 3, , so . By rule (3) and Step 3, , so ; this doubling recurrence starting at gives .