Hacker News new | past | comments | ask | show | jobs | submit login

What information led to your opinion?



I think LLMs have higher complexity in the white-/black-hat "struggle domain" than the weakest-link problem, maybe O(N^2) vs. O(NlogN).

So if it used to be O(N) white against O(NlogN) black, it's now evenly matched, with O(N^2) LLMs on both sides.




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

Search: