Is There Anything Bigger Than Graham’s Number?
Graham’s number: TREE(3): appears in relation to a theorem on trees in graph theory. Representation of the number is difficult, but one weak lower bound is AA(187196)(1), where A(n) is a version of the Ackermann function. … SSCG(3) is not only larger than TREE(3), it is much, much larger thanRead More →