4 ms·
Maybe I missed it, but it was interesting that tetration was mentioned without talking about Graham’s number g_64[0] or Kruskal’s tree theorem and TREE(3)[1], b
by IHLayman 7y ago
Maybe I missed it, but it was interesting that tetration was mentioned without talking about Graham’s number g_64[0] or Kruskal’s tree theorem and TREE(3)[1], both have been quite popular huge numbers for quite a while now.
0: https://en.wikipedia.org/wiki/Graham's_number https://en.wikipedia.org/wiki/Graham's_number
1: https://en.wikipedia.org/wiki/Kruskal's_tree_theorem https://en.wikipedia.org/wiki/Kruskal's_tree_theorem
- ErotemeObelus 7y agoTREE(ACKERMAN(g_64, g_64))
- maze-le 7y agoI think the most fascinating bit about Grahams Number is, that is is used as an upper bound in a proof about colored subgraphs in a completely connected graph of dimension [n]. But this is only an upper bound... the actual number of dimensions [n] that satisfies the proof is unknown, but it could be as low as 13 for all we know...