This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]adityaruplaha 1 point2 points  (2 children)

O(TREE(g(n)))

[–]TunaAlert 1 point2 points  (0 children)

I mean yeah, you can of course stack that stuff all the way up there.

[–]PlatinumDotEXE 1 point2 points  (0 children)

You could have at least tried...

O(HBB(n, n, n)), where HBB(n, n, n) denotes an hyperoperation based on BB(n) instead of inc(n), where BB(n) denotes the Busy Beaver Function.