logoalt Hacker News

baoooooooooooo • yesterday at 10:40 PM • 0 replies • view on HN

This comment always comes up but isn’t this literally irreducibly complex in the sense of Kolmogorov complexity?

I’m out of my depth here but it does seem prompts have a “smell” to their complexity that means we can use a classifier to mate them to a model with better success than random noise, but still don’t essentially all of the savings associated with systems like this just come because there is some “complexity arbitrage” where there is enough of a token cost differential between models that you always save money by trying the cheap model first and then trying a hard model if it turns out to be hard?