• jet@hackertalks.comOPMEnglish
      1·
      22 days ago

      Great video, thanks for pointing it out! I’m subscribed now

      I was confused about how this would solve the conjecture, because if the busy Beaver eliminates all of the non-halting machines, couldn’t one of them have been the conjecture?

      • badcommandorfilename@lemmy.worldEnglish
        2·
        22 days ago

        I think knowing the BB number of a set is akin to knowing that all problems in that set are either halting or non-halting. I don’t think the important part is the number itself but rather knowing that all programs have been checked.

        Hence, once BB(27) is known then that will mean the Goltbach conjecture is proven true or false.