Reducibility Among Combinatorial Problems (1972) [pdf]

(cgi.di.uoa.gr)

10 points | by liamswayne 5 hours ago ago

1 comments

  • daniel65464 3 hours ago ago

    Im not a math guy, if Gemini is correct and this paper shows 3-SAT is NP, I think we have enough proof that LLM are just really good recall machines, and they are fully incapable of new ideas. This behavior is incredible useful, and society will adapt the same way excel didn't obsolete accountants.