7 ms·
What about finding the 1st known complex structure over S^6, proving Ehrhart’s volume conjecture, proving a sharp "density" bound on primitive sets conjectured
by ogogmad 13d ago
What about finding the 1st known complex structure over S^6, proving Ehrhart’s volume conjecture, proving a sharp "density" bound on primitive sets conjectured by Erdos >60 years ago?
> Finding counterexamples is low-hanging fruit, the automation of which isn't shocking.
It's not good to be confidently wrong the way you're being.
- kuschku 13d agoWe've had mathematical problems solved by brute force in the past. We've then improved that through systems similar to prolog intentionally searching a tree. Then systems added heuristics for which paths in that tree are likely to be taken. The LLMs are just using slightly more accurate heuristics for this task. But the real measure of understanding are tasks that are not so strictly constrained.
- frabcus 12d agoIf a foundation model company burns billions of tokens to brute force an LLM into finding a new training algorithm that e.g. allows recurrent networks without catastrophic forgetting... I won't really care that it didn't have a "real measure of understanding". I'll care that it has made an even more dangerous technology, which needs work to make it aligned.
- deleted 12d ago[deleted]