Proven? I don’t think so. I don’t think there’s a way to devise a formal proof around it. But there’s a lot of evidence that, even if it’s technically solvable, we’re nowhere close.
Indeed; it definitely would show some promise. At that point, you’d run into the problem of needing to continually update its weighting and models to account for evolving language, but that’s probably not a completely unsolvable problem.
So maybe “never” is an exaggeration. As currently expressed, though, I think I can probably stand by my assertion.
We will never solve the Scunthorpe Problem.
It causes so much dawizard.
If only one could buttassinate censorship…
Don’t you mean buttbuttinate?
bottombottominateFTFY
I have no rebottomal for this comment.
It’s a clbuttic
Truly in a clbottom of its own
Hasn’t it been proven unsolvable?
Proven? I don’t think so. I don’t think there’s a way to devise a formal proof around it. But there’s a lot of evidence that, even if it’s technically solvable, we’re nowhere close.
Have you tried adding a few more kilobytes of regex?
Or a few more gb of LLM?
I swear, I just need 4-5 more graphics cards to solve this!
Impossible. There is always some mf named like cum-sock, smh
Excuse me? My family BUILT this country!
Or Grab-her.
I mean, you could just use a vaguely smarter filter. A tiny "L"LM might have different problems, but not this one.
Indeed; it definitely would show some promise. At that point, you’d run into the problem of needing to continually update its weighting and models to account for evolving language, but that’s probably not a completely unsolvable problem.
So maybe “never” is an exaggeration. As currently expressed, though, I think I can probably stand by my assertion.
So a TLM?
Awww, it’s trying its best!
there’s a very trivial solution that always works actually, it’s called “stop being a prude”