Definition
In theoretical computer science, the busy beaver game aims to find a terminating program of a given size that either produces the most output possible, or runs for the longest number of steps. Since an endlessly looping program producing infinite output or running for infinite time is easily conceived, such programs are excluded from the game. Rather than traditional programming languages, the programs used in the game are n-state Turing machines, one of the first mathematical models of computation.
Related concepts
Ackermann's functionAckermann functionAlexander DewdneyAlgorithmAsymptotic analysisAxiom of choiceAxiomatic systemBell System Technical JournalBusy beaver (disambiguation)Cellular automataChaitin's incompleteness theoremComputability theoryComputable functionComputational complexity theoryComputer programConjectureConway's Game of LifeCountableCountable setCounterexampleEndless loopEric W. WeissteinEuropean Association for Theoretical Computer ScienceFinite setGitHubGoldbach's conjectureGregory ChaitinGödel's first incompleteness theoremGödel's incompleteness theoremsHalting problemIf and only ifJournal of the ACMKnuth's up-arrow notationKolmogorov complexityLambda calculusLarge cardinal axiomLean 4MathWorldMathematical gameMathematical proofMathematics MagazineMathematics of ComputationNatural numberNoncomputable functionNondeterministic Turing machineOhio State UniversityOn-Line Encyclopedia of Integer SequencesOpen problem in mathematicsPaul ErdősPentationPhysica (journal)Physical Church-Turing thesisPhysical quantityRayo's numberRegister machineRiemann hypothesisRocqScientific AmericanScott AaronsonSpace complexityStephen WolframSubtle cardinalSwitching circuit theoryTaylor L. BoothTetrationTheoretical computer scienceTheory of Computing SystemsTibor RadóTuring machineTuring machine examplesTurmiteUnary Number SystemUnary numeral systemUndecidable problemUniversity of AugsburgUp toZFCZermelo–Fraenkel set theory
17 concepts already in your glossary