this post was submitted on 01 Feb 2025
7 points (81.8% liked)

jet's interesting finds

55 readers
1 users here now

my journal

founded 3 months ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 3 points 2 months ago* (last edited 2 months ago) (1 children)
[–] [email protected] 1 points 2 months ago* (last edited 2 months ago) (1 children)

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?

[–] [email protected] 2 points 2 months 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.