Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

cdn.openai.com

Post reply on HN
Print view View original

291–300 of 467 posts

Re: GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

#291

Post by chaoxu »

romaniv wrote: post #244

No one here actually cares about Cycle Double Cover Conjecture. I can demonstrate this by pointing out that the only time this conjecture was ever mentioned on the website was 14 years ago in a submission[1] that linked to a (now retracted) proof paper. That story received exactly zero upvotes. No one cared enough to upvote it and no one cared enough to ever mention this conjecture again. [1] https://news.ycombinator…

I care. I was a math student in my undergrad when I try to solve a particular problem on paths, in the end it uses a path version of cycle double cover conjecture (which was solved in the 90s).

https://chaoxu.prof/posts/2013-01-30-there-exist-a-path-of-l...

I also want to get it to work on cycles, but then I hit the cycle double cover conjecture so I gave up.

Re: GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

#292

Post by fragmede »

onecomment1 wrote: post #283
perching_aix wrote: post #271

Earlier quoted context omitted.

Thanks for the fun facts? Indeed, this is not a math forum. Good morning. > I can demonstrate this [that literally nobody cares about the CDCC here] No, you cannot. Mindreading the readers of this site by sifting through people's comments is a barely passable proxy for this at best, especially when that audience has changed dramatically over even just those 14 years, and continues to do so.

[flagged]

Wait, what things do we care about?

Re: GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

#293

Post by deinonychus »

romaniv wrote: post #244

No one here actually cares about Cycle Double Cover Conjecture. I can demonstrate this by pointing out that the only time this conjecture was ever mentioned on the website was 14 years ago in a submission[1] that linked to a (now retracted) proof paper. That story received exactly zero upvotes. No one cared enough to upvote it and no one cared enough to ever mention this conjecture again. [1] https://news.ycombinator…

i care about the CDCC but every time i post about it dang removes it and bans me

Re: GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

#294

Post by lquist »

romaniv wrote: post #244

No one here actually cares about Cycle Double Cover Conjecture. I can demonstrate this by pointing out that the only time this conjecture was ever mentioned on the website was 14 years ago in a submission[1] that linked to a (now retracted) proof paper. That story received exactly zero upvotes. No one cared enough to upvote it and no one cared enough to ever mention this conjecture again. [1] https://news.ycombinator…

It’s the second most important problem in all of graph theory on this database of open math problems:

https://www.openproblemgarden.org/category/graph_theory?sort...

Obviously not an exact measurement but to give you some sense of the importance of the problem

Re: GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

#295

Post by scarmig »

fragmede wrote: post #292
onecomment1 wrote: post #283

Earlier quoted context omitted.

[flagged]

Wait, what things do we care about?

Two years from now, when a proof of the Collatz conjecture is announced and verified:

"No one cares about that! What practical applications does it have? It's pretty trivial anyways. More hype from the AI psychosis crowd."

Re: GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

#296

Post by nullsanity »

lquist wrote: post #294
romaniv wrote: post #244

No one here actually cares about Cycle Double Cover Conjecture. I can demonstrate this by pointing out that the only time this conjecture was ever mentioned on the website was 14 years ago in a submission[1] that linked to a (now retracted) proof paper. That story received exactly zero upvotes. No one cared enough to upvote it and no one cared enough to ever mention this conjecture again. [1] https://news.ycombinator…

It’s the second most important problem in all of graph theory on this database of open math problems: https://www.openproblemgarden.org/category/graph_theory?sort... Obviously not an exact measurement but to give you some sense of the importance of the problem

[dead]

Re: GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

#297

Post by 8note »

onecomment1 wrote: post #283
perching_aix wrote: post #271

Earlier quoted context omitted.

Thanks for the fun facts? Indeed, this is not a math forum. Good morning. > I can demonstrate this [that literally nobody cares about the CDCC here] No, you cannot. Mindreading the readers of this site by sifting through people's comments is a barely passable proxy for this at best, especially when that audience has changed dramatically over even just those 14 years, and continues to do so.

[flagged]

the real world problems we care about are straightforward, the main challenge is wealth distribution and control over the power to do something about them

Re: GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

#298

Post by scarmig »

mNovak wrote: post #253

Unrelated to the accomplishment or proof itself, but it's interesting how much of the prompt, even in this latest-and-greatest model, is spent essentially telling the model to actually solve the problem. Things like "Reject status reports, vague optimism, and claims that an unproved global compatibility statement is 'routine'." Also a lot prompt spent feeding it strategies, which feel like they should/will eventually…

LLMs have basic reasoning and a whole lot of memorization. Through that basic reasoning and pruned search, combined with piles of compute, you can prove lots of things. But the memorization of human failure prunes that possibility, and you need to expend effort convincing the LLM not to prematurely prune based on previous human failure.

Re: GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

#300

Post by p-e-w »

lquist wrote: post #294
romaniv wrote: post #244

No one here actually cares about Cycle Double Cover Conjecture. I can demonstrate this by pointing out that the only time this conjecture was ever mentioned on the website was 14 years ago in a submission[1] that linked to a (now retracted) proof paper. That story received exactly zero upvotes. No one cared enough to upvote it and no one cared enough to ever mention this conjecture again. [1] https://news.ycombinator…

It’s the second most important problem in all of graph theory on this database of open math problems: https://www.openproblemgarden.org/category/graph_theory?sort... Obviously not an exact measurement but to give you some sense of the importance of the problem

Don’t bother. This is the third or fourth time AI has solved an open conjecture, and once again the comment sections everywhere are full of people explaining how this doesn’t really matter at all, how it’s an irrelevant, obscure problem, how any mediocre grad student could probably have solved it if only they had bothered to try, and how of course, human mathematicians will still be vastly superior to machines 100 years from now because they have that magic spark for which nobody can say what it supposedly consists of.

These discussions have nothing to do with mathematics, and everything to do with ego and fear. I’ve never been less impressed with humans than since AI started challenging them.

Post reply on HN