News for hackers. Stuff that matters.
Re:IMO Grand Challenge by throwaway-ai-ai on Saturday October 26, 2019 @08:43AM (#21363293)
Suppose your assertion about this problem being easy was true.

Most research papers in Math / Theoretical CS are < 50 pages, while many IMO problems have solutions > 1 page. So it's only a factor of 50 "more complex."

Then, we should be able to encode open problems / conjectures in Math / Theoretical CS into Lean, run this brute fore approach, and have it start auto generating new publications.

To the best of my knowledge, no one has done this yet.

Re:IMO Grand Challenge by eru on Saturday October 26, 2019 @09:20AM (#21363479)
Well, the IMO problems are constructed with a solution in mind.

Also, who says that efforts goes up linearly with size?

(Not necessarily agreeing with lordnacho here, just saying that your argument ain't a good one.)

Re:IMO Grand Challenge by NieDzejkob on Saturday October 26, 2019 @12:35PM (#21364641)
That's a good point. If we assume each line of a publication is just applying an axiom, the complexity of such a search is clearly exponential in the length of an article. I feel like this wouldn't be better if we dropped the assumption.
Re:IMO Grand Challenge by oefrha on Saturday October 26, 2019 @11:21AM (#21364180)
Complexity is a terrible measure of mathematical value. Length of exposition is even worse.