Busy Beaver numbers

Concept

A sequence of numbers representing the maximum output of a Turing machine of a given size before halting. It grows uncomputably rapidly and encodes mathematical truths.

Mentioned in 1 video

Videos Mentioning Busy Beaver numbers

Scott Aaronson on Computational Complexity Theory and Quantum Computers

Scott Aaronson on Computational Complexity Theory and Quantum Computers

Y Combinator

A sequence of numbers representing the maximum output of a Turing machine of a given size before halting. It grows uncomputably rapidly and encodes mathematical truths.