Hacker News new | ask | show | jobs
by fny 544 days ago
It’s like everyone suddenly forgot you can’t do O(n^2) compute in O(n) time.
1 comments

Binary addition is O(n)
I meant this in the general case, not specifically binary addition. Also, returning an token by ChatGPT is technically an O(1) operation, so the same principle applies. Returning a computation answer of O(n_required_tokens) cannot be delivered in O(1) time without some sort of caching.