Note busy beavers are often defined just for Turing machines on an input tape which is initially blank.

Applications in Coding theorem method

https://en.wikipedia.org/wiki/Busy_beaver

Understanding proof for Busy Beaver being uncomputable