The Wikipedia snippet below is not backed by a reliable source. Can you find one?
Click I got this! to go to Wikipedia and fix the snippet, or Next! to see another one. Good luck!
In page Busy beaver:
"A simple generalization is the extension to Turing machines with m symbols instead of just 2 (0 and 1).[1] For example a trinary Turing machine with m = 3 symbols would have the symbols 0, 1, and 2. The generalization to Turing machines with n states and m symbols defines the following generalized busy beaver functions:
- Σ(n, m): the largest number of non-zeros printable by an n-state, m-symbol machine started on an initially blank tape before halting,[citation needed] and
- S(n, m): the largest number of steps taken by an n-state, m-symbol machine started on an initially blank tape before halting.[1]