7 ms·
It's mind blowing. It's so simple, elegant and... effective! Grep+glob and a lot of iterations is all we need.
by nbstme 1y ago
It's mind blowing. It's so simple, elegant and... effective! Grep+glob and a lot of iterations is all we need.
- Analemma_ 1y agoWe always suspected find+grep+xargs was Turing-complete, and now Claude is proving it.
- nbstme 1y agoExactly. AGI implies minimal tooling and very primitive tools.
- SV_BubbleTime 1y agoAGI implies that a system is financially viable to let run 24 hours a day with little to no direction. No amount of find+grep+LLM is even remotely there yet.
- delusional 1y agoThat's one of the most nonsensical comments on all of hackernews. A Markov change could have wrote it. What do you mean Turing complete? Obviously all 3 programs are running on a Turing complete machine. Xargs is a runner for other commands, obviously those commands can be Turing complete. I haven't heard of anybody working on a _proof_ for the Turing completeness of xargs, and I think the only conference willing to publish it would be Sigbovik.
- hyperbovine 1y agoCan’t tell which of these two comments is the joke …
- EdwardDiego 1y agoIt was a joke.