Timeline for Does log(log(n)) grow asymptotically slower than log(n) / log(log(n))?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Dec 10 at 8:26 | history | suggested | minh quý lê |
adding the asymptotic tag
|
|
| Dec 10 at 3:11 | review | Suggested edits | |||
| S Dec 10 at 8:26 | |||||
| Dec 9 at 19:36 | vote | accept | maybesunny | ||
| Dec 9 at 19:31 | answer | added | minh quý lê | timeline score: 2 | |
| Dec 9 at 19:21 | comment | added | Simd | Yes it is true. But when we say grow faster this is really an asymptotic statement. For fixed and reasonably sized values of $n$ a slower growing function may still be larger than a faster growing. Take 10^100 and O(n) as examples. The former doesn't grow at all. | |
| S Dec 9 at 16:54 | review | First questions | |||
| Dec 9 at 19:36 | |||||
| S Dec 9 at 16:54 | history | asked | maybesunny | CC BY-SA 4.0 |