Tetration
Jump to navigation
Jump to search
Tetration is an operation that can be understood as repeated exponentiation. Tetration sometimes appears in CA-related discussions, as a way of expressing very large lifespans or bounds on lifespans.[1][2][3]
Definition
If a, n are positive integer numbers, then the nth tetration of a (usually denoted either a ⇈ n or na) is the value of the expression
(i.e. the "power tower" with n copies of a, where the exponentiations are evaluated right-to-left).
The number a is called the base, and the number n is called the height.
The nth tetration of a can also be defined recursively:[note 1]
- a ⇈ 1 = a,
- a ⇈ (n + 1) = aa ⇈ n.
For example,
- 10 ⇈ 2 = 1010 = 10,000,000,000
- 10 ⇈ 3 = 101010 = 1010,000,000,000
- 3 ⇈ 3 = 333 = 327 = 7,625,597,484,987
Notes
- ↑ By rewriting the second line as a ⇈ n = loga(a ⇈ (n + 1)), it is possible to define a ⇈ 0 = 1 and a ⇈ −1 = 0.
See also
References
- ↑ Search "tetration" on ConwayLife.com
- ↑ Search "tetrational" on ConwayLife.com
- ↑ Search "tetrationally" on ConwayLife.com
Further reading
- "Telling the tale of two tetrations". a blog by biggiemac42 (April 17, 2022).
- "Tetrational machines". Complex Projective 4-Space (June 23, 2022).
- "Miscellaneous discoveries". Complex Projective 4-Space (July 23, 2023).
- D. E. Knuth (1976) Mathematics and Computer Science: Coping with Finiteness
- "Tetration". Wikipedia.
