About this document
Exploring the Busy Beaver Limits by Cave Johnson is a document available to read on EtoBox.
While adding axioms to theories can help prove properties of Turing machines, this process can be automated and is ultimately limited by the busy beaver function. Simulating human thought and physics may require understanding languages with large but finite vocabularies and grammars, corresponding to busy beaver numbers on the order of millions, emphasizing how "big numbers break our ideas of truth."
- Author
- Cave Johnson
- Language
- EN