The smallest known value of n for which the busy beaver function, BB(n), is greater than Graham's number is 18. This was achieved on a blog post in which the author designed an 18-state turing machine which outputs with more than Graham's number 1's on the tape. Their turing machine can be found in the txt file in this repository. I made a simple visualization of the computation.
-
Notifications
You must be signed in to change notification settings - Fork 0
JacobDreiling/Busy-Beaver-of-18
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description or website provided.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published