News for hackers. Stuff that matters.
Re:Announcing three new discoveries in mathematics, computer... by sevenzero on Tuesday October 27, 2026 @04:52AM (#50256249)
If everything of this can be represented in Lean, with enough compute, they are low hanging fruits, yes
Re:Announcing three new discoveries in mathematics, computer... by hkalbasi on Tuesday October 27, 2026 @05:27AM (#50256510)
So maybe everything is now low hanging fruit, with your definition.
Re:Announcing three new discoveries in mathematics, computer... by gimlichgu on Tuesday October 27, 2026 @06:52AM (#50257180)
maybe, or maybe some problems turn out to be reasonably defeatable by educated guess brute forcing with lots of compute and big models pointing the search in reasonable directions.
Re:Announcing three new discoveries in mathematics, computer... by juliusjh on Tuesday October 27, 2026 @07:30AM (#50257549)
Yes, maybe what is hard for LLMs and what is hard for humans have a very small overlap. But calling it brute force or low-hanging fruits is still a bit absurd.

You can safely argue that it's statistics, because by construction it is. But then, maybe nothing is anything more than statistics.

Re:Announcing three new discoveries in mathematics, computer... by saikia81 on Tuesday October 27, 2026 @05:28AM (#50256517)
Mathematics is easy if you just brute force the problem domain is not what is happening here
Re:Announcing three new discoveries in mathematics, computer... by hardbass on Wednesday October 28, 2026 @03:50AM (#50270390)
If everything can be represented in a Turing computer or a Fourier Series, does it make it trivial? Are you sure you know the computability power of these representations?