Thus TREE (3) > tree $_3$ (tree $_2$ (tree (8))). As you can imagine, the TREE (n) function clearly outpaces the tree (n) function, which is already at the level of the Small Veblen Ordinal in the fast …

Reading online, it generally seems accepted that TREE(n) where n >= 3 is a finite number, but large enough to be incomputable and only has extremely loose lower bounds today. TREE(n) is the function

Dec 9, 2019 · Can someone explain TREE (3) to me? How does the function work? Keep it VERY simple. If you can't explain it, what resources should I look at to understand it? Keep in mind that we …

May 31, 2022 · 2 I know, from Kruskal's tree theorem, that the sequence of trees mentioned in the TREE function cannot be infinite. However, why can't the sequence of trees get arbitarily large, so that …

Nov 30, 2020 · 7 I saw a question which asked, "When does Busy Beaver surpass TREE (n)?" I am asking a somewhat different question, about a specific value of TREE. I know that TREE (3) is an …

Oct 14, 2024 · I have recently found out about the TREE function, and how TREE (3) is unimaginably large. I also learned about Graham's number, which is a lot smaller than TREE (3). Yet, is there …

Oct 2, 2016 · I'm interested in where TREE(n) would rank on the fast growing hierarchy. I've read that the small tree(n) function is bound by the Small Veblen Ordinal. Given that TREE(n) grows faster, …

Oct 10, 2018 · I was just introduced to the TREE() function, by a 2017 Numberphile video. In it, Tony Padilla explains a simplified version of the calculation of the TREE function: We are building a forests …

Oct 19, 2023 · TREE (3) is an extremely large number that requires ordinal arithmetic to prove it is finite. For what value of n would G(n)> TREE(3) G (n)> T R E E (3)? The length of the Goodstein sequence …

10 I was reading the Wikipedia article on Friedman's finite form of Kruskal's tree theorem, and am interested in the large numbers TREE (n). I would like to verify TREE (2)=3 myself, but find …