If you want an unproven-but-almost-certainly-correct upper bound on BB(6), consi... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		thaumasiotes 66 days ago \| parent \| context \| favorite \| on: Why Busy Beaver hunters fear the Antihydra If you want an unproven-but-almost-certainly-correct upper bound on BB(6), consider BB(12).

sligocki 65 days ago [–]

Not sure if this is a joke, but actually that is guaranteed to be true. It is proven that for all n: BB(n+1) >= BB(n) + 3. But it is not proven that BB(n+1) >= BB(n) + 4, haha.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact