Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

It’s like everyone suddenly forgot you can’t do O(n^2) compute in O(n) time.


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.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: