Busy beavers gone wild
Logic in Computer Science
2009-06-22 v1
Abstract
We show some incompleteness results a 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.
Cite
@article{arxiv.0906.3257,
title = {Busy beavers gone wild},
author = {Grégory Lafitte},
journal= {arXiv preprint arXiv:0906.3257},
year = {2009}
}