Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
tromp
on July 3, 2024
|
parent
|
context
|
favorite
| on:
With fifth busy beaver, researchers approach compu...
While the official formula [1] is (4(n+1))^(2n) , if one ignores the symbol written and head movement for transitions to halt, then this becomes (4n+1)^(2n), which is ~ 17 trillion for n=5.
[1]
https://oeis.org/A052200
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[1] https://oeis.org/A052200