When does the busy beaver function surpass TREE(n)?

2.8k Views Asked by At

Since TREE is a computable function the BB function grows faster than it, but TREE seems to grow much more quickly early on, so when does Busy Beaver surpass it?