The busy beaver function BB(n) is defined as the largest finite number of steps any n-state Turing machine can run before halting (on a blank input), and it provably grows faster than any computable function, so naming BB(1000) would utterly defeat any opponent in a largest-number contest who doesn't know the function.

definitionpending

Speaker

Scott Aaronson

Evidence Quote

“if you say busy beaver of a thousand then you will utterly destroy any opponent who doesn't know about the busy beaver function”

Source

Scott Aaronson - Quantum Computing, Complexity, and Creativity— Dwarkesh Patel
Created: 6/13/2026, 7:00:25 PM

Your notes

Loading notes...