Busy Beaver function
Description: A function in computability theory giving the maximum number of symbols a halting Turing machine can write, subject to a limit on its states.
Primary topic: Computability, Logic, AI Algorithms (84%)
Wikidata ID: wiki/Q1427965
OpenAlex ID: keywords/busy-beaver-function
