Timeline for How large is TREE(3)?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2015 at 19:18 | review | Late answers | |||
| Sep 30, 2015 at 0:45 | |||||
| Sep 22, 2012 at 2:54 | comment | added | Deedlit | Chris Bird's notations are very interesting, but they serve much the same function as the fast-growing hierarchy does. Note that I had to choose a very specific definition of fundamental sequences for the Hardy hierarchy to get proven inequalities; Comparing TREE(3) to Bird's notation, or indeed to the Hardy hierarchy for a different definition of fundamental sequences, seems quite difficult. And then there's the problem of finding an upper bound for TREE(3); so far, I am at a loss. The problem is not really notational, as the Hardy and fast-growing hierarchies extend quite far. | |
| Sep 14, 2012 at 16:07 | history | answered | Danny | CC BY-SA 3.0 |