Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
codeflo
on Jan 25, 2017
|
parent
|
context
|
favorite
| on:
Really big numbers
I think you're correct. For the same reason, the proposed "more quickly" growing G(n) is bounded by (constant + n)^n, which is not much of an improvement.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: