Comment on Google DeepMind used a large language model to solve an unsolvable math problem
mumblerfish@lemmy.world 1 year agoIt’s not brute forcing though. It is similar to genetic programming, it seems, but with more less understood parts.
Comment on Google DeepMind used a large language model to solve an unsolvable math problem
mumblerfish@lemmy.world 1 year agoIt’s not brute forcing though. It is similar to genetic programming, it seems, but with more less understood parts.
jacksilver@lemmy.world 1 year ago
I mean, I would also call genetic algorithms a form of brute forcing. And just like with genetic algorithms, this approach is going to be severely limited by the range of values that can be updated and the ability to test the outcome.
mumblerfish@lemmy.world 1 year ago
Why would you not be able to test the outcome fully? And what do you mean by “limited by the range of values that can be updated”?
jacksilver@lemmy.world 1 year ago
So they configured the experiment so that only certain lines of code were able to be iterared/updated. Maybe you could ask it to start from scratch, but I imagine that would increase the time for it to converge (if it ever does).
Regarding testing, not all mathematical proofs can be verified by example. Here they were trying to prove that there was an even lower bound for the problem, but not all proofs will work with that structure.