Googology Wiki
Advertisement
Googology Wiki

This is a category of numbers which are variants of the Busy Beaver function. While numbers based on Rayo's number maximise definability in formal languages, these numbers maximise outputs of computational models, for example Turing machines. These numbers are uncomputable due to the famous halting problem.

All items (8)

Advertisement