Comment on Google DeepMind used a large language model to solve an unsolvable math problem

missingredient@sh.itjust.works ⁨1⁩ ⁨year⁩ ago

• TimeSquirrel@kbin.social ⁨1⁩ ⁨year⁩ ago

  Isn't that how we learn too? We stop doing the things that don't work in favor of things that do while repeatedly "brute forcing" ourselves (training/practice).

  source

  • PhantomPhanatic@lemmy.world ⁨1⁩ ⁨year⁩ ago

    It’s more like educated guessing which is a lot faster than brute forcing. They can use code to check the answers so there is ground truth to verify against. A few days of compute time for an answer to a previously unsolved math problem sounds a lot better than brute forcing.

    source
  • 14th_cylon@lemm.ee ⁨1⁩ ⁨year⁩ ago

    it is what we (the people) do as well. we look at the data and try to find a pattern. but the computer can process larger amount of data than people can.that’s it.

    source
  • mini_dr_evil@sh.itjust.works ⁨1⁩ ⁨year⁩ ago

    no. your claim sounds ridiculous.

    source

    • TimeSquirrel@kbin.social ⁨1⁩ ⁨year⁩ ago

      I didn't claim anything. I asked.

      source
    • feedum_sneedson@lemmy.world ⁨1⁩ ⁨year⁩ ago

      Well don’t be a poopy pants!

      source
• mumblerfish@lemmy.world ⁨1⁩ ⁨year⁩ ago

  It’s not brute forcing though. It is similar to genetic programming, it seems, but with more less understood parts.

  source

  • 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.

    source

    • 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”?

      source

      • 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.

        source