| Property | Value |
|---|
| rdfs:label | |
| rdfs:comment | - The supertet is equal to {4,4,4,4} in BEAF.. It can also be written 4{{{{4}}}}4, or 4 & 4, using the array of operator. The term was coined by Jonathan Bowers. It is decently close to a well-known combinatorial constant, Harvey Friedman's n(4). Supertet can be computed in 3-bracket operator notation using the following process: Supertet is comparable to \(f_{\omega^2}(4)\) in the fast-growing hierarchy.
|
| dcterms:subject | |
| dbkwik:googology/property/wikiPageUsesTemplate | |
| abstract | - The supertet is equal to {4,4,4,4} in BEAF.. It can also be written 4{{{{4}}}}4, or 4 & 4, using the array of operator. The term was coined by Jonathan Bowers. It is decently close to a well-known combinatorial constant, Harvey Friedman's n(4). Supertet can be computed in 3-bracket operator notation using the following process:
* \(t_1 = 4\)
* \(t_2 = 4 \lbrace4\lbrace4\lbrace4brace^{3}brace^{3}brace^{3} 4\)
* \(t_3 = 4 \lbrace4\lbrace4\cdots\lbrace4brace^{3}4brace^{3}\cdotsbrace^{3}4 \) with \(t_2\) 4's from the center out.
* \(t_4 = 4 \lbrace4\lbrace4\cdots\lbrace4brace^{3}4brace^{3}\cdotsbrace^{3}4 \) with \(t_3\) 4's from the center out.
* etc.
* Supertet is \(t_{t_{t_{\cdots1}}}\), where \(t_{t_{t_{\cdots1}}}\), where \(t_{t_{t_{t_1}}} t's\). Supertet is comparable to \(f_{\omega^2}(4)\) in the fast-growing hierarchy.
|
