Title of article
Busy beavers gone wild
Author/Authors
Gregory Lafitte، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
123
To page
129
Abstract
We show some incompleteness results à la Chaitin using the busy beaver functions. Then, with the help of ordinal logics, we show how to obtain a theory in which the values of the busy beaver functions can be provably established and use this to reveal a structure on the provability of the values of these functions.
Journal title
Electronic Proceedings in Theoretical Computer Science
Serial Year
2009
Journal title
Electronic Proceedings in Theoretical Computer Science
Record number
679678
Link To Document