12 points sebg 2 days ago 3 comments
perching_aix 34 minutes ago | parent
Author is a math professor who somehow wants you to believe that he didn't know what a computational model is until OpenAI's manuscript dump a few days ago. In this post, he now extends that pretending game to galactic algorithms.
Very gonzo, but maybe I prefer to learn about these things with a little less circlejerk.
traes 30 minutes ago | parent
Post #1,000,037 complaining about AI in math by ragging on the existence of pure math. Sigh.
QuesnayJr 18 minutes ago | parent
This is another rant about the author's bugaboo.
It would be great to prove that there is or isn't a non-galactic polynomial-time algorithm for NP-complete problems. But we can't even solve the easier problem of proving there is or isn't a galactic polynomial-time algorithm, so what hope is there for the harder problem?
If you could prove that any polynomial-time algorithm for NP problems had to be galactic, you would be the most celebrated computer scientist since Turing. It's just no one has any idea how to do that.