Elektrine lite

← Feed

@antoinechambertloir@mathstodon.xyz

2026-09-10 19:11 UTC

#Math #AI 14/n There is another argument against the principle for this kind of technology that I have learned from the philosopher Walter Dean. Computer science has defined precisely what an algorithm is and given means to evaluate how efficient those algorithms are. Moreover, it has delimited various classes of problems regarding efficiency of the algorithms that can solve them. Two classes are of prominent importance: - Problems for which we know fast algorithms (called P in the computer science jargon); - Problems for which we don't know fast algorithms but for which we have efficient way to check solutions (called NP in that jargon). A hard question in computer science is to prove that the class NP is really larger than the class P, this is what computer scientists believe, but can't prove. The difficulty of some problems in the NP class is at the heart of modern cryptography (hence the whole security of Internet), and if you have heard about quantum computing (or things such as “post-quantum cryptography”), this is because it would make the two classes much closer one from the other, and “breaking” those cryptographic protocols. The relation with my thread is that finding a proof of a theorem is a hard problem of the NP class, even for classes of very simple theorems. Which means that we can reasonably check proofs, as proof assistants do, but that it is very unlikely that there be efficient algorithms to find proofs.

Replies (1)

  • #Math #AI 15/n The outcome of this reflection is that I am very skeptical of everything that comes from the LLM world. What this summer taught me is that I was partly wrong. But this morning, bang!, I was informed by a friend of a paper that appeared on September 4th on the database of mathematical publications, by three prominent algebraic geometers, Lev Borisov, Ofer Gabber and Adrian Vasiu, entitled “On endomorphisms of affine spaces and the Jacobian problem”. This 176-page (!) paper is precisely devoted to counterexamples to the Jacobian conjecture and to various companion conjectures in commutative algebra. As is often the case in mathematical papers, it ends with an AI statement that says that no AI was used, nor were any of their results computer-based nor suggested by computer-generated data. But one of the authors, Vasiu, adds a puzzling paragraph where he explains that an earlier version of the file (from January 2025) had accidentally been made accessible on the Internet (I could explain how such things happen), and he says that he believes that its content had leaked to the database of material that AI companies use for generating texts. Indeed, on July 23, some AI could produce a 37-page that makes a detailed comparison between Alpöge's example and the theory of Borisov-Gabber-Vasiu as explained in the leaked version of their work. On the opposite, the disproof of the Jacobian conjecture published by ulam.ai (https://www.ulam.ai/research/jacobian.pdf) on the basis of Alpöge's tweet contains no reference to any serious bibliography, and nothing of Borisov-Gabber-Vasiu. https://arxiv.org/abs/2609.05746

    Open ##5153664