Mild Shock
2025-02-09 15:02:26 UTC
Reply
PermalinkNow history repeats itself. There are
many pseudo software engineering program
verification papers, that say, just chop
up a problem, and solve each part separately,
and put the things together. Which is utter
nonsense. Try this with a SAT Solver,
the smallest unit is the propositional variable
you cannot solve it independently, only
"try" 0 and 1, eh voila you are back to
NP Complete. Thank god we have Christos
Papadimitriou. According to Wikipedia he is
is the author of the textbook Computational
Complexity, one of the most widely used
textbooks in the field of computational
complexity theory. Might be the cure for
any singularity and AGI dreams:
Chatbot Software Begins to Face Fundamental Limitations
Recently, computer scientist Binghui Peng and
his team proved mathematically that there may
be a hard limit to LLMs’ compositional
task-solving abilities
https://www.quantamagazine.org/chatbot-software-begins-to-face-fundamental-limitations-20250131/
Bye