* There is a class of problems which are harder than polynomial time complexity to solve, but are not np-complete
* LLMs will generate an "answer" in formal language to this class of problems posed to it
* LLMs can at most solve problems with polynomial time complexity due to their fundamental design and principles
* Therefore, LLMs cannot solve > polynomial problems and not np-complete problems either
All of which I buy completely. But I think what people are more interested in is, why is it that the LLM gives an answer when we can prove that it cannot answer this problem correctly? And perhaps that is more related to the commonsense notion of hallucination than I first gave it credit for. Maybe the reason that an LLM gives a formal language answer is the same reason it gives a hallucinatory answer in natural language. But I don't think the paper sheds light on that question