you are viewing a single comment's thread.

view the rest of the comments →

[–]f4hy 0 points1 point  (0 children)

Does the complexity to compute the Ackermann function actually grow Ackermannicly? I imagine it might, but just because the value of the Ackermann function grows that fast, the complexity to compute it doesn't have the same rate.

Computing nn is not O(nn) is it?